Printable View
http://www.youtube.com/watch?v=kPRA0W1kECg
I did not create this. Full credit goes to the author.
More information: http://panthema.net/2013/sound-of-sorting/
Algorithms used in the video:
- selection sort
- insertion sort
- quick sort
- merge sort
- heap sort
- radix sort (LSD)
- radix sort (MSD)
- std::sort (intro sort)
- std::stable_sort (adaptive merge sort)
- shell sort
- bubble sort
- cocktail shaker sort
- gnome sort
- bitonic sort
- bogo sort
Also, radix sort (LSD) sounds like something from a creepy horror film.
Bogo sort is obviously the best sort. That O(1) time, man, can't believe not many people use it.
dat bogo sort
bogo sort is basically miracle cubes
beautiful
dat bogo (finally something i can understand)
A funny explanation of the bogo was in the Wikipedia article for it
also: dat quantum bogosort:Quote:
Imagine you have a deck of cards, you check if its ordered and if it isn't you simply throw all the cards in the air and then check again until its ordered.
Quote:
Quantum Bogosort
An in-joke among some computer scientists is that quantum computing could be used to effectively implement a bogosort with a time complexity of O(n).[8] It uses true quantum randomness to randomly permute the list. The list is then inspected, and if it is not in order, the universe is destroyed. By the many-worlds interpretation of quantum physics, the quantum randomization spawns 2^N (where N is the number of random bits) universes and one of these will be such that this single shuffle had produced the list in sorted order.
Bubble Sort and Cocktail Shaker Sort both sounded like slowed down Pac-Man sound effects to me.
Also laughed hard at that bogo sort.
did anyone else thing gnome sounded like a bunch of chihuahua barking?
And that bogo, idk y, i had a sense of impending doom as that thing continued :C
Crap, I confused quantum bogo and regular bogo. I didn't watch the video :f7:.Quote:
Originally Posted by FenixR
Back to college for me.
The bogo sort mad me smile. This is definitely a good day now.
I have no idea what i'm watching but it feels good.
This video reminds me of my college days, although I have no idea what half of those sorts are. Which one is the fastest at sorting large data do you think?
Probably one that is O(n) rather than the O(n log n) shown in most of these. Most use Timsort of Insertion Sort + IntrosortQuote:
Originally Posted by IImaplers