Sort Visualizer - Visualization for Sorting algorithms

Sort Real-time random array values and adjust speed and height for different algorithms along with documentation explaining sorting algorithms

Features and Interfaces

HomePage
- Responsive website with the dropdown in navbar and animation in title, and below are cards of different sorting algorithms.
- The cards contain a button to redirect you to a page where you can visualize the sorting algorithm, and also each card contain a brief description and time and space complexity.

At last, it contains a form where you can contact me just by typing your message here, and it will redirect you to mail me with an already written message.

Sorting Page
- It opens with such a page containing 3 buttons for creating a random array, then a sort button to sort, and then to clear. Along with it contains the speed factor and height factor slider.
- Then we will create a random array (blue button) where the random array of size ten is created.
- We can also adjust the height factor to make bars small or big.
- After this, we will click on the sort button, and we can observe the sorting visualization.
- And finally, our array is sorted.
- And we can clear this by clicking on the clear button (red button). Like bubble sort, we have the selection, insertion, quick, and heap sort.
Documentation Page
- We have a theory about sorting algorithms.
- Along with its time complexity, space complexity, and description about it.

In this article, you will learn what sorting algorithm is and different sorting algorithms.

A sorting algorithm is used to arrange elements of an array/list in a specific order. For example,

Sorting Algorithm	Time Complexity-Best	Time Complexity-Worst	Time Complexity-Average	Space Complexity
Selection Sort	n²	n²	n²	1
Insertion Sort	n	n²	n²	1
Bubble Sort	n	n²	n²	1
Quick Sort	nlog n	n²	nlog n	log n
Heap Sort	nlog n	nlog n	nlog n	1
Merge Sort	nlog n	nlog n	nlog n	n

Sorting Algorithm	Description
Selection Sort	Selection sort finds the smallest element in the array and place it on the first place on the list, then it finds the second smallest element in the array and place it on the second place. This process continues until all the elements are moved to their correct ordering. It carries running time O(n2) which is worst than insertion sort.
Insertion Sort	As the name suggests, insertion sort inserts each element of the array to its proper place. It is a very simple sort method which is used to arrange the deck of cards while playing bridge.
Bubble Sort	It is the simplest sort method which performs sorting by repeatedly moving the largest element to the highest index of the array. It comprises of comparing each element to its adjacent element and replace them accordingly.
Quick Sort	Quick sort is the most optimized sort algorithms which performs sorting in O(n log n) comparisons. Like Merge sort, quick sort also work by using divide and conquer approach.
Heap Sort	In the heap sort, Min heap or max heap is maintained from the array elements deending upon the choice and the elements are sorted by deleting the root element of the heap.
Merge Sort	Merge sort follows divide and conquer approach in which, the list is first divided into the sets of equal elements and then each half of the list is sorted by using merge sort. The sorted list is combined again to form an elementary sorted array.