This project analyzes and compares the performance of different sorting algorithms using Python. The system generates random data, applies multiple sorting methods on the same dataset, measures execution time, and displays the results on a simple GUI developed using Tkinter. Features 1.Random array generation 2.Multiple sorting algorithms (Bubble, Selection, Insertion, Merge, Quick etc.) 3.Time measurement for each algorithm 4.Shows original array and sorted array 5.Tkinter GUI based program 6.Easy to compare algorithm performance
How It Works
1.User generates a random list of numbers. 2.Chooses a sorting algorithm from dropdown. 3.System sorts the list and displays: Original Unsorted List Sorted Result Time taken by algorithm 4.Helps to discover which algorithm is faster on different inputs.