A web application to visualize sorting algorithms in action. Watch how different sorting algorithms work step by step with interactive controls.
- Bubble Sort
- Quick Sort
- Merge Sort
- Heap Sort
- Insertion Sort
- Selection Sort
- Visual representation of sorting process
- Adjustable array size and sorting speed
- Color-coded elements to track sorting progress
- Generate new random arrays
- Responsive design for all devices
| Algorithm | Best | Average | Worst | Space |
|---|---|---|---|---|
| Bubble Sort | O(n) |
O(n²) |
O(n²) |
O(1) |
| Quick Sort | O(n log n) |
O(n log n) |
O(n²) |
O(log n) |
| Merge Sort | O(n log n) |
O(n log n) |
O(n log n) |
O(n) |
| Heap Sort | O(n log n) |
O(n log n) |
O(n log n) |
O(1) |
| Insertion Sort | O(n) |
O(n²) |
O(n²) |
O(1) |
| Selection Sort | O(n²) |
O(n²) |
O(n²) |
O(1) |
- Clone the repository
git clone https://github.com/kxshrx/Sortit.git-
Open
index.htmlin your browser -
Start visualizing:
📊 Choose a sorting algorithm 🎚️ Adjust the array size and speed 🔄 Click 'Generate New Array' for a new sequence ▶️ Press 'Sort' to start visualization
Kishore @kxshrx