https://github.com/doug-wade/algorithmsgreatesthits

Python 3 implementations of various algorithms
https://github.com/doug-wade/algorithmsgreatesthits

Last synced: 19 days ago
JSON representation

Python 3 implementations of various algorithms

• Host: GitHub
• URL: https://github.com/doug-wade/algorithmsgreatesthits
• Owner: doug-wade
• License: mit
• Created: 2013-08-06T01:07:53.000Z (over 11 years ago)
• Default Branch: master
• Last Pushed: 2015-05-12T00:17:31.000Z (over 9 years ago)
• Last Synced: 2024-10-30T11:07:48.550Z (2 months ago)
• Language: Python
• Size: 316 KB
• Stars: 1
• Watchers: 3
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# AlgorithmsGreatestHits

Python 3 implementations of various algorithms and data structures for studying.

## Installing the dependencies

Quick sort requires numpy, which you can install with pip, or for users on Ubuntu-based linux distros, by installing the python3-numpy package from aptitude.

## Running the Tests

To run the tests for one class:

    python3 -m unittest path.to.class

For example, to run the binary search tress tests:

    python3 -m unittest data_structures.test_binarysearchtree

To run all unit tests:

    python3 -m unittest discover

There are also a couple of performance tests that can't be run at the same time as other tests:

    python3 -m unittest data_structures.perf_test_trie

## TODO

### Refactor

* data_structures

** Implement heaps for yourself

### Unit test

* data_structures

** graph

* graph_algorithms

** all of them

* other_algorithms

** all of them

* search_algorithms

** rselect

To run all unit tests:

    python3 -m unittest discover

## TODO

### Refactor

* data_structures

** split heaps into 3 files

### Unit test

* data_structures

  * graph

* graph_algorithms

  * all of them (FOR SHAME)

* other_algorithms

  * all of them (SLACKER)

## Contributing

I'm... not sure why you would?