https://github.com/ravicv168/sorting-visualizer
Sorting Visualizer to understand the working of various sorting algorithms.
https://github.com/ravicv168/sorting-visualizer
css html javascript sorting-algorithms-implemented
Last synced: 3 months ago
JSON representation
Sorting Visualizer to understand the working of various sorting algorithms.
- Host: GitHub
- URL: https://github.com/ravicv168/sorting-visualizer
- Owner: Ravicv168
- Created: 2024-10-31T12:06:44.000Z (12 months ago)
- Default Branch: main
- Last Pushed: 2024-11-23T15:59:53.000Z (11 months ago)
- Last Synced: 2025-04-07T01:31:04.404Z (7 months ago)
- Topics: css, html, javascript, sorting-algorithms-implemented
- Language: JavaScript
- Homepage:
- Size: 34.2 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Sorting Visualizer
This Sorting Visualizer project demonstrates various sorting algorithms through an interactive visualization. The user can see how different sorting algorithms work by visualizing how elements are swapped and moved during the sorting process.
## The project features the following sorting algorithms:
- Bubble Sort
- Selection Sort
- Insertion Sort
- Merge Sort
- Quick Sort
- Heap Sort
The algorithms are implemented with optimal time and space complexities to help understand their efficiency. The visualizer allows users to control the speed of the algorithm execution and visualize how elements change positions at each step
## Skills Demonstrated:
### Sorting Algorithms Implementation:
#### Implemented common sorting algorithms with correct time and space complexity:
- Bubble Sort: O(n^2) worst-case time complexity.
- Selection Sort: O(n^2) worst-case time complexity.
- Insertion Sort: O(n^2) worst-case time complexity.
- Merge Sort: O(n log n) worst-case time complexity.
- Quick Sort: O(n log n) average time complexity.
- Heap Sort: O(n log n) worst-case time complexity.
#### Understanding Algorithm Efficiency (Time and Space Complexity):
Displayed time complexity of each sorting algorithm (Best, Worst, and Average cases).
Helped users compare the efficiency of algorithms by understanding the impact of data size on performance.
## Instructions to Run the Project:
### Clone the repository to your local machine:
git clone https://github.com/Ravicv168/Sorting-Visualizer.git.
Open the sort.html file in your browser to start the visualizer.
### Interact with the sorting visualizer:
- Adjust the array size.
- Control the sorting speed.
- Select the sorting algorithm.