-
Notifications
You must be signed in to change notification settings - Fork 0
Project completed in Design and analysis of algorithms (CSE - 5311 )under Prof. Bhanu Jain. This project implements Insertion sort, merge sort, and quick sort along with calculating time required for algorithms to sort 4 lists of data structures of different lengths, Comparing and contrasting the results between the three sorting algorithms.
mrunmaim16/insertion-merge-and-quick-sort-implementation
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
To run the program 1.Open a command prompt or terminal window and navigate to the directory where the program files are located. 2.Run the program using the command python3 InsertionSort.py for Insertion Sort, python3 mergeSort.py for Merge Sort & python3 QuickSort.py for Quick sort
About
Project completed in Design and analysis of algorithms (CSE - 5311 )under Prof. Bhanu Jain. This project implements Insertion sort, merge sort, and quick sort along with calculating time required for algorithms to sort 4 lists of data structures of different lengths, Comparing and contrasting the results between the three sorting algorithms.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published