Visualizing sorting algorithms, using the matplotlib library.

Algorithms covered so far:

Install

pip install -r requirements.txt

Run

python main.py function_name

Pass function name as a command line argument from list of functions above (in all lower case and spaces replaced by underscore).

For example:

python main.py quick_sort

If you want to add a new sorting algorithm:

1. Code the algorithm in sorting.py.
2. Name the function appropriately, like quick_sort, bubble_sort.
3. While coding the function, do not use python lists. Instead, use an Array object. The Array class is defined in sorting.py. (See already implemented algorithms, for your reference)
4. The Array object has swap, set, get_len, get methods implemented. Feel free to implement any more, additional methods, that you may see fit.
5. Make sure you add the sorting algorithm to the Readme file!
6. Make sure your newly implemented algorithm works, by running test.py after appending it to the list of algorithms in test.py.

#Newly added algorithm - Radix Sort using Counting Sort

Keeping the description short because of the time limit and giving the reference for more information.

Radix sort is non-comparative sorting algorithm.

Benefit:

Lower Bound for usual comparison based algorithms if O(nlog n ) while for radix sort is O(n+k) time when elements are in range from 1 to k.

Best reference: https://www.hackerearth.com/practice/algorithms/sorting/radix-sort/tutorial/