Project Overview
This interactive sorting algorithm visualizer is an educational tool designed to help students and developers understand how different sorting algorithms work. The application provides real-time visualization of six fundamental sorting algorithms, allowing users to see exactly how data is compared, swapped, and organized during the sorting process.
Built with performance in mind, the visualizer uses HTML5 Canvas for smooth animations and provides detailed metrics about each algorithm's performance. Users can adjust the array size and animation speed to better understand the algorithms at their own pace, making it an ideal learning resource for computer science students and anyone interested in algorithm optimization.
Bubble Sort
Bubble Sort repeatedly steps through the list, compares adjacent elements and swaps them if they're in the wrong order.
Key Features
- Real-time visualization of 6 different sorting algorithms (Bubble, Selection, Insertion, Merge, Quick, and Heap Sort)
- Interactive controls for array size (10-150 elements) and animation speed (5 speed levels)
- Live performance metrics tracking comparisons, swaps, and execution time
- Color-coded visualization showing comparing elements, pivot points, and sorted sections
- Pause and resume functionality to analyze algorithms step-by-step
- Detailed complexity information for each algorithm (time and space complexity)
- Responsive design that works seamlessly on desktop and mobile devices
- Random array generation for testing different scenarios
- Educational descriptions explaining how each algorithm works
- Smooth Canvas-based animations for optimal performance