Analysis of various sorting algorithms.
This project helps in understanding the time complexity, that is to find out and analyse the time taken for each of the sorting algorithms to complete sorting a fixed or random dataset. Analysis of these algorithms help us in determining the quickest and most effective method to sort data under various circumstances and scenarios.
For the latest stable version, head to Releases.
Download and extract the source code.
As an alternative, you could also clone the repository using,
git clone https://github.com/sabareeshreddy/Algorithm-Analysis.git
Once you have all the files on your local system, you can launch it by double-tapping the Sorting_visualizer.py file present in the src folder. You can do this only if you have the python launcher installed.
Else, cd/ to the src folder on your terminal and type python Sorting_visualizer.py.
Enter the number of terms to be sorted and select your sorting algorithm.
Note: Once the visualization is completed, you can find all the information about it present within the Sorting_algorithm_data.csv file created in the src folder.
Data collected