Developed an interactive and visually appealing sorting visualizer in Python using Tkinter and Pygame. The application supports multiple sorting algorithms, including Merge Sort, Bubble Sort, Radix Sort, Insertion Sort, Selection Sort, Quick Sort, Heap Sort, and Counting Sort. Users can:
Generate arrays of custom size with specified minimum and maximum values.
Control sorting speed with pause/play functionality or adjust to make sorting faster/slower.
Observe each algorithm's time and space complexity in real-time.
The project combines algorithm learning with an engaging visual interface, making it perfect for educational purposes and interactive demonstrations.
