An Array-Sorting visualizer using JavaScript which gives a visual representation of how different sorting techniques work.
🔗 Live site: Array Sorting Visualiser
- Create or find an unassigned issue.
- Fork and clone this repo.
- Create a branch with your name.
- Add your code.
- Create a pull request.
|
This algorithm will iterate over the array and repeatedly compare adjacent elements, swapping them if they are not in the correct order. 
|
This algorithm will iterate over the array, finding the minimum element from the unsorted portion, and swap it in place with the first element of unsorted portion. 
|
|
This algorithm splits the array into sorted and unsorted parts, picking elements from the unsorted portion and placing them in the correct position of the sorted portion. 
|
This algorithm recursively splits the array in half until it cannot be further divided. It will then begin merging from the smallest units based on the comparison of the two, and continue until you have a final sorted array. 
|
|
This algorithm picks a pivot element and partitions the array around the pivot. The partition will put all array elements greater than the pivot to the right, and lesser than to the left. This is called recursively to produce the sorted array. 
|
When choosing a sorting algorithm, you must consider the limitations and requirements.
|