Python implementations of QuickSort , MergeSort , and Insertion sort. The program records execution time of each function and displays elapsed times in a graph.
Instructions for running: -Be sure to have Python installed -Run the program
Information: When the program is ran youll notice the terminal will be outputting information as it runs, Youll see numbers of increasing sizes, these are the sizes of the arrays being run on the functions.
When the program finishes a graph will be displayed in a separate tab with the various algorithms listed. You can then return to the output terminal and see that the demo arr has been successfully sorted. You can also see an array of the execution times for each othe the functions.
Below are Screenshots of the code.
