search

bruch-alex / sorting-algorithm-visualization

This program offers real-time visualizations of various sorting algorithms
1 stars 1 forks source link

readme

Visualization of different sorting algorithms

Insertion sort gif

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:

Table of Contents

Algorithms

Bubble 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.

Click to show Bubble Sort Visualization

Bubble Sort visualization

Selection Sort

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.

Click to show Selection Sort Visualization

Selection Sort visualization

Quick Sort

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.

Click to show Quick Sort Visualization

Quick Sort visualization

Insertion Sort

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.

Click to show Insertion Sort Visualization

Insertion Sort visualization

Heap Sort

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.

Click to show Heap Sort Visualization

Insertion Heap visualization

How to Build & Run

Requirements

Check and update JDK

Click for Ubuntu/Debian details

**Check default** JDK version: ``` java -version ``` **List all** installed JDK and **change default** JDK if needed: ``` sudo update-alternatives --config java ``` **Install JDK** (You may change `11` here to newer versions): ``` sudo apt install openjdk-11-jdk ```

How to Run?

  1. Download .jar file from latest release.

  2. Open terminal in a folder where the .jar file is located. Run this command to start the program (check that filenames are matching):

java -jar sav-1.4-jar-with-dependencies.jar

How to Build executable file?

  1. Download this repo
  2. 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 where version will look like 1.4 for example.