Sorting Algorithm Simulator
Visualize and learn all major sorting algorithms interactively!
About the Project
This desktop application is built with Python and PyQt6. It allows users to interactively explore sorting algorithms step by step, visualize array changes, and understand the algorithm logic through educational explanations.
Features
- 15+ Sorting Algorithms: Basic (Bubble, Insertion, Selection, Cocktail, Comb), Efficient (Merge, Quick, Heap, Shell, IntroSort), Non-Comparison (Counting, Radix, Bucket, Pigeonhole), and Educational (Bogo Sort)
- Interactive Visualization: Step-by-step execution with color-coded bars showing comparisons, swaps, and sorted regions
- Comprehensive Controls: Array size selector, array type (random, ascending, descending, nearly sorted, custom), CSV import, sorting speed control
- Advanced Navigation: Start, Pause/Resume, Reset, Step Forward, Step Backward buttons for precise control
- Real-time Performance Metrics: Track comparisons, swaps, and execution time during simulation
- Educational Content: Detailed explanations for each algorithm step and comprehensive algorithm reference table
- User-Friendly Interface: Multi-tab design with Simulator, Algorithms, Performance, and About tabs
- Academic Design: Clean light theme with value labels displayed under each bar for clear visualization
Download & Repository
GitHub Repository
Download Windows Build
Direct Download Windows Build 260 MB: Download
sha256:66bd610d8a2e57609ee3b892f679ed79829fe81a0bd54754221e71dbad54efac