********# Sorting Visualizer in Java************
Welcome to the Sorting Visualizer! π This Java-based project brings sorting algorithms to life by visually (not right now, but in the future, yes!!!) demonstrating how they work step by step. The application uses bar graphs and scatter plots to help you intuitively understand the mechanics behind popular sorting techniques.
- Bubble Sort β A simple algorithm that repeatedly compares and swaps adjacent elements until the array is sorted.
- Merge Sort β A classic divide-and-conquer method that splits the array into halves, sorts them recursively, and merges them back together.
- Insertion Sort β Builds the sorted array incrementally by placing each element in its correct position.
- Quick Sort β A fast divide-and-conquer algorithm that partitions elements around a pivot and sorts the partitions independently.
- Bar Graphs β Displays array elements as vertical bars where height corresponds to value.
- Scatter Charts β Shows how elements move and rearrange during the sorting process.
- Speed Control β Slow down or speed up the visualization to study sorting at your own pace.
- Algorithm Selection β Pick any of the implemented algorithms to visualize.
- Code Display β Option to toggle the algorithmβs source code for better understanding.
- Custom Input β Enter your own dataset and watch it get sorted in real time.
PSA: WORKING ON FRONTEND IN THE FUTURE YOU WILL SEE A FULL FUNCTIONAL WEBSITE