You signed in with another tab or window.Reload to refresh your session.You signed out in another tab or window.Reload to refresh your session.You switched accounts on another tab or window.Reload to refresh your session.Dismiss alert
Visualizing sorting algorithms, using the matplotlib library.
Algorithms covered so far:
Name
Function Name
Quick Sort
quick_sort
Bubble Sort
bubble_sort
Selection Sort
selection_sort
Insertion Sort
insertion_sort
Heap Sort
heap_sort
Merge Sort
merge_sort
Usage:
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
How to contribute
If you want to add a new sorting algorithm:
Code the algorithm insorting.py.
Name the function appropriately, likequick_sort,bubble_sort.
While coding the function,do not use python lists. Instead, use anArray object. TheArray class is defined insorting.py. (See already implemented algorithms, for your reference)
TheArray object hasswap,set,get_len,get methods implemented. Feel free to implement any more, additional methods, that you may see fit.
Make sure you add the sorting algorithm to the Readme file!
Make sure your newly implemented algorithm works, by runningtest.py after appending it to the list of algorithms intest.py.