Welcome to our sorting algorithm visualization project! This program offers real-time visualizations of various sorting algorithms, allowing you to understand and compare them in action. It currently supports the following algorithms:
- Bubble Sort
- Selection Sort
- Quick Sort
- Insertion Sort
- Heap Sort
Bubble Sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order. This process continues until the list is fully sorted, with larger elements " bubbling" to the top. For e.g: in ascending order, the largest elements gradually move to the last position with each pass.
Show Bubble Sort Visualization
Selection Sort is a simple comparison-based algorithm that sorts a list by dividing it into a sorted and an unsorted part. It repeatedly finds the smallest (or largest) element from the unsorted part and swaps it with the first unsorted element, gradually growing the sorted portion until the entire list is sorted.
Show Selection Sort Visualization
QuickSort is a highly efficient sorting algorithm that uses a divide-and-conquer approach. It selects a "pivot" element and partitions the array into two sub-arrays: one with elements less than the pivot and one with elements greater than the pivot. This process is recursively applied to each sub-array until the entire list is sorted.
Show Quick Sort Visualization
Insertion Sort is a simple sorting algorithm that builds a sorted list one element at a time. It picks the next element from the unsorted list, finds its correct position in the sorted list, and inserts it there. This process repeats until all elements are sorted.
Show Insertion Sort Visualization
HeapSort is a sorting algorithm that uses a binary heap data structure to sort elements. It first builds a max heap from the input data, then repeatedly removes the largest element from the heap and places it at the end of the list, sorting the list in ascending order.
Show Heap Sort Visualization
You need at least java 11
- Clone this repo
- Open terminal in a root folder and run this command
mvn clean package
This command will create /taget folder and executable sav-version-jar-with-dependencies.jar inside.
-
Download
.jarfile from latest release. -
Open terminal in a folder where the
.jarfile is located. Run this command to start the program:
java -jar sav-1.2-jar-with-dependencies.jar