SortingStudio is an interactive and educational Sorting Algorithm Visualizer built using HTML, CSS, and JavaScript. It demonstrates how different sorting algorithms work step by step while providing insights into their time complexities and performance.
- Visual representation of sorting algorithms.
- Algorithms implemented:
- 🔵 Bubble Sort
- 🟢 Insertion Sort
- 🟡 Selection Sort
- 🔴 Merge Sort
- 🟣 Quick Sort
- Displays Time Complexity for each algorithm.
- Calculates and displays the total run time of each sorting process.
- Simple, clean, and responsive UI for a better user experience.
- HTML5 – For the structure of the web page.
- CSS3 – For styling the web page.
- JavaScript – For implementing sorting logic and dynamic visualization.
| Algorithm | Best Case | Average Case | Worst Case | Space Complexity |
|---|---|---|---|---|
| Bubble Sort | O(n) | O(n²) | O(n²) | O(1) |
| Insertion Sort | O(n) | O(n²) | O(n²) | O(1) |
| Selection Sort | O(n²) | O(n²) | O(n²) | O(1) |
| Merge Sort | O(n log n) | O(n log n) | O(n log n) | O(n) |
| Quick Sort | O(n log n) | O(n log n) | O(n²) | O(log n) |
- Select a sorting algorithm from the provided options.
- Watch the algorithm step-by-step as it sorts the array visually.
- View the time complexity and total run time displayed after execution.
- Add more sorting algorithms like Heap Sort, Radix Sort, etc.
- Include sound effects for visualization steps.
- Add a comparison mode for analyzing multiple algorithms simultaneously.
- Optimize visualization for larger datasets.
Contributions are welcome! Please fork this repository, make your changes, and open a pull request. If you like this project, don't forget to give it a ⭐!