Implementation of sort algorithms in a way that allows each file to be run as a script, priting it's own timing, or as a module, with all other files at once, allowing a comparison between timings.
A startup.py script is provided in order to run them all at once, printing their respective timing for comparison sake.
python startup.py
if you wish to run each module separetely(as a script) all you gotta do is run it letting python know that it's a module inside a package.
i.e.
python -m sort_algorithms.heap_sort.py
Some of those scripts even have some customized output when run alone, in order to make the process executed as clear as possible.
I created this rep because I didn't gave enough attention to those basics concepts back in university. Studying algorithms and data structures in order to become a better developer led me to implement all of these again, and so I decided to share.