Skip to content

Commit

Permalink
# Fix issue
Browse files Browse the repository at this point in the history
  • Loading branch information
harrypotter0 committed Jan 22, 2018
1 parent fbf0031 commit 1bca110
Show file tree
Hide file tree
Showing 9 changed files with 16 additions and 50 deletions.
66 changes: 16 additions & 50 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -2,71 +2,37 @@

This is just a collection of algorithms I wanted to implement in order to improve my understanding. They are NOT optimized and probably shouldn't be used in production code.

Here is the complete list ::

To run all unit tests:
## DP

python3 -m unittest discover test
## Geometry

## Trees

## quicksort
## Union_find

Recursive implementation of the quick sort algorithm.
## String

To run tests:
## Recursion

python3 quicksort.py
## Sorting and Basics

## Arrays

## mergesort
## Graphs

Recursive implementation of the merge sort algorithm.
## Testing

To run tests:
## Heaps

python3 mergesort.py
## CP

## Data-Structures

## hashtable
## Lists

Simple hashtable implementation
## Miscellaneous


## autoresizelist

A helper class used to implement the heap.

To run tests:

python3 autoresizelist.py


## heap

Implementation of a heap.

To run tests:

python3 heap.py


## nqueens

Backtracking solution to the n-queens problem (just finds the first one).

To run:

python3 nqueens.py

To run tests:

python3 -m unittest discover test --pattern="*nqueens*"


## combinatorics

Various combinatoric functions like permutations and combinations.

To run:

python3 combinatorics.py

File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.

0 comments on commit 1bca110

Please sign in to comment.