Sorting-Visualizer-Tool - Eric Karpovits

Description: This tool graphically sorts and searches from a list of random integers of any size (default: 100 numbers) using three sorting algorithms and a search algorithm that uses an iterative and recursive computing method. The user can shuffle and reset the list of numbers as they choose. Additionally, they can pick from the following sorting and search algorithms to sort and search through a set of unsorted numbers. Enjoy the project and tool :).

1. Bubble sort - Average Time Complexity: O(n²) 
2. Insertion sort - Average Time Complexity: O(n²) 
3. Merge sort - Average Time Complexity: O(n⋅Log(n)) 
4. Binary Search -  Average Time Complexity: O(Log(n))

Merge Sort Demo: