Visual representation, with auidio effect of the most common sorting algorithms written in pure javascript and HTML.
You can test it out here
- starts with insertion sort for smaller parts (32 pieces)
- merge sort for parts created by insertion stage
- binary search in the sorted segment and then insertion on the correct position
- selects the smallest element and puts at the end of the sorted segment
- chose random pivot (element from array) move everything smaller to the left of the pivot and everything larger to the right
- repeat for the right part and left part separated by the pivot
- merge increasingly bigger array parts starting at 1 using 2 moving pivots
- compare each element with the next one if the next one is smaller swap them
- randomly shuffle array and hope for the best :D
- delete each element that is not bigger than the previous one
- LSD/MSD (Least/Most Significant Digit)
- Separate data into digits
- for each value create bucket and move all values with according value on current digit to that bucket repeat
- PS: MSD works better since the numbers are represented as floats with a lot of digits