A dynamic and interactive way to explore sorting algorithms in action. Watch how different algorithms process and organize data step by step, revealing their efficiency and behavior through real-time visualization. Compare performance, understand complexity, and gain deeper insights into sorting techniques through engaging animations.
✅ Custom Input: Enter your own numbers to visualize their sorting process.
✅ Random Generation: Generate a random dataset to test different algorithms.
✅ Sorting Control: Start and stop the sorting process anytime using the Start and Stop buttons.
✅ Speed Adjustment: Modify sorting speed, especially useful for large datasets.
✅ Algorithm Selection: Choose from multiple sorting algorithms:
| Algorithm | Average Complexity | Worst-Case Complexity |
|---|---|---|
| Bubble Sort | O(n²) | O(n²) |
| Merge Sort | O(n log n) | O(n log n) |
| Insertion Sort | O(n²) | O(n²) |
| Selection Sort | O(n²) | O(n²) |
| Quick Sort | O(n log n) | O(n²) (rare cases) |
This project aims to provide a better understanding of sorting algorithms through a visual and interactive approach, allowing users to analyze their performance based on the number of elements being sorted.
- HTML
- CSS
- JavaScript
Contributions are welcome! Feel free to suggest improvements, add new algorithms, or optimize animations.