SortAlgorithm is a web development project that allows real-time visualization of sorting algorithms such as Merge Sort and Quick Sort, as well as pathfinding algorithms(Underway). This web app provides an interactive way to understand and learn about these algorithms through visualizations.
Let's delve deeper into the time and space complexities of these sorting algorithms:
| Sorting Algorithm | Time Complexity-Best | Time Complexity-Worst | Time Complexity-Average | Space Complexity |
|---|---|---|---|---|
| Selection Sort | O(n^2) | O(n^2) | O(n^2) | O(1) |
| Insertion Sort | O(n) | O(n^2) | O(n^2) | O(1) |
| Bubble Sort | O(n) | O(n^2) | O(n^2) | O(1) |
| Quick Sort | O(n log n) | O(n^2) | O(n log n) | O(log n) |
| Heap Sort | O(n log n) | O(n log n) | O(n log n) | O(1) |
| Merge Sort | O(n log n) | O(n log n) | O(n log n) | O(n) |
- Real-time visualization of sorting algorithms.
- Support for popular sorting algorithms, including Merge Sort and Quick Sort.
- Pathfinding algorithm visualization for solving various graph-related problems.
- Select a sorting algorithm or a pathfinding algorithm from the Nav Bar.
- Configure algorithm settings if applicable.
- Click the "Visualize" button to start the visualization.
Contributions to SortCanva are welcome! If you'd like to contribute to this project, please follow these guidelines:
- Fork the repository.
- Create a new branch for your feature or bug fix.
- Make your changes and commit them.
- Push your changes to your fork.
- Submit a pull request to the main repository.