Sorting Out Sorting - Part 3
Loading...
7,017
Top Comments
see all
All Comments (7)
-
Heapsort could be made a lot faster by having a temporary storage for the highest number. Then when a space is cleared up by moving the other numbers up the tree, you just push the lower numbers over to the left and put the higher number in the blank space. I think the main reason heapsort lost to Tree Selection is that they put the lowest numbers at the top of the tree each time!
-
I have seen this video 3 times now in college. the music kills me haha
-
if you are really interested in this, this is a great movie. but if you don't, if will bore you to death. luckily i'm the first type
-
OMG Caroline = HERO
-
Stick around for the 9 up comparison. Thanks for the post, would be great to see it as one movie instead of three awkwardly chopped ones.
Loading...
"Let this be a lesson aboubt O(n^2) sorts" This cracked me up :D
Incrediblastic 3 years ago 18
Bubble Sort = EPIC FAIL
YouJustWait 2 years ago 11