A Java based desktop application which animates many of the fundamental sorting and searching algorithms used in Computer Science. Through our application, users will gain a better understanding of how these algorithms truly function.
Our application have some unique options such as
* Media Controls
- Pause/Play
- Forward/Backward
- Restart
* Speed Control
* Custom Datasets
* Text Color Customization
Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted. The algorithm, which is a comparison sort, is named for the way smaller or larger elements "bubble" to the top of the list. Although the algorithm is simple, it is too slow and impractical for most problems even when compared to insertion sort. Bubble sort can be practical if the input is in mostly sorted order with some out-of-order elements nearly in position. [1]
Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort. Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. At each iteration, insertion sort removes one element from the input data, finds the location it belongs within the sorted list, and inserts it there. It repeats until no input elements remain. [2]
Selection sort is an algorithm that takes divides the input list into two parts: a sorted sublist of items which is built up from left to right at the front (left) of the list and a sublist of the remaining unsorted items that occupy the rest of the list. Initially, the sorted sublist is empty and the unsorted sublist is the entire input list. The algorithm proceeds by finding the smallest (or largest, depending on sorting order) element in the unsorted sublist, exchanging (swapping) it with the leftmost unsorted element (putting it in sorted order), and moving the sublist boundaries one element to the right. [3]
Quicksort is a divide-and-conquer algorithm. It works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. For this reason, it is sometimes called partition-exchange sort. The sub-arrays are then sorted recursively. This can be done in-place, requiring small additional amounts of memory to perform the sorting. [4]
In computer science, a linear search or sequential search is a method for finding an element within a list. It sequentially checks each element of the list until a match is found or the whole list has been searched. [5]
Is a search algorithm that finds the position of a target value within a sorted array. Binary search compares the target value to the middle element of the array. If they are not equal, the half in which the target cannot lie is eliminated and the search continues on the remaining half, again taking the middle element to compare to the target value, and repeating this until the target value is found. If the search ends with the remaining half being empty, the target is not in the array. [6]
Steps to install the app:
- Download and install the latest version of the Java Runtime Environment for your computer
- Download an IDE such as Intellij for example.
- Clone this repository
- Open up the repository in your IDE
- If you would like to try the database functionality within the settings page go to merge-home-and-main branch and follow below steps otherwise skip below
- Install Maven (https://maven.apache.org/install.html)
- Please check maven dependencies in both the Java spring application and the Algorithm Application. We reccomend to use Intellij to run the application.
- Installing Mysql (https://dev.mysql.com/doc/mysql-getting-started/en/)
Here you will find a textbox filled with preset data to use or the user can manually enter a data set. Then the user can choose an Algorithm that they would like to learn. The user can enter the settings page from the home screen as well.
On this page the user can customize the look and feel of the application. Also this is where users can use our "Submit Feedback" form to let us know how we can improve!
The user will be able to visually learn the selected algorithm. The user will also be able to speed up or slow down the animation to aid them in understanding the algorithm. There is a pause/play button which allow the user to take their time learning. Additionally, the user will also be able to edit the data set by adding or deleting elements as they please, and all of this can be done right there on the learning page. Our searching algorithms will also allow the user search for a specific number in the data set.
Sponsored by Dr. Qi Wang from SUNY, University at Albany.
Contributors:
- David
- Kyler
- Noah
- Ahmad
- Bubble sort. (2021). Wikipedia. https://en.wikipedia.org/wiki/Bubble_sort
- Insertion sort. (2021). Wikipedia. https://en.wikipedia.org/wiki/Insertion_sort
- Selection sort. (2021). Wikipedia. https://en.wikipedia.org/wiki/Selection_sort
- Quick Sort. (2021). Wikipedia. https://en.wikipedia.org/wiki/Quicksort
- Linear search. (2021). Wikipedia. https://en.wikipedia.org/wiki/Linear_search
- Binary search algorithm. (2021). Wikipedia. https://en.wikipedia.org/wiki/Binary_search_algorithm
- Linear Search. (2021). GeeksforGeeks. https://www.geeksforgeeks.org/linear-search/
- Binary Search. (2021). GeeksforGeeks. https://www.geeksforgeeks.org/binary-search/
- Bubble Sort. (2021). GeeksforGeeks. https://www.geeksforgeeks.org/bubble-sort/
- Insertion Sort. (2021). GeeksforGeeks. https://www.geeksforgeeks.org/insertion-sort/
- Selection Sort. (2021). GeeksforGeeks. https://www.geeksforgeeks.org/selection-sort/
- Quick Sort. (2021). GeeksforGeeks. https://www.geeksforgeeks.org/quick-sort/
- Java Swing | Creating a Toast Message. (2021). GeeksforGeeks. https://www.geeksforgeeks.org/java-swing-creating-toast-message/