Visualization of 24 Sorting Algorithms In 2 Minutes

"Visualization of 24 different sorting algorithms:
- Selection Sort
- Insertion Sort
- Binary Insertion Sort
- Merge Sort
- Quick Sort (LR ptrs)
- Quick Sort (LL ptrs)
- Quick Sort (ternary, LR ptrs)
- Quick Sort (ternary, LL ptrs)
- Quick Sort (dual pivot)
- Bubble Sort
- Cocktail Shaker Sort
- Gnome Sort
- Comb Sort
- Shell Sort
- Heap Sort
- Smooth Sort
- Odd-Even Sort
- Bitonic Sort
- Cycle Sort
- Radix Sort (LSD)
- Radix Sort (MSD)
- std::sort (gcc)
- Tim Sort
- Block Merge Sort (WikiSort)
..."

More:
http://www.youtube.com/watch?v=ZZuD6iUe3Pc
http://www.youtube.com/watch?v=kPRA0W1kECg
siftbotsays...

Moving this video to ant's personal queue. It failed to receive enough votes to get sifted up to the front page within 2 days.

oritteroposays...

Bubble sort can outrun quicksort on many common input types (almost or completely sorted is very common for instance, and one where bubble sort will always win).

They missed bogosort! It checks if the data is sorted and randomly shuffles the data if not. In the quite common case of already sorted data it will also beat quicksort.

Obligatory xkcd https://xkcd.com/1185/

CrushBugsaid:

Wow, I forgot how much Bubble Sort sucks.

Send this Article to a Friend



Separate multiple emails with a comma (,); limit 5 recipients






Your email has been sent successfully!

Manage this Video in Your Playlists




notify when someone comments
X

This website uses cookies.

This website uses cookies to improve user experience. By using this website you consent to all cookies in accordance with our Privacy Policy.

I agree
  
Learn More