Quick Sort

Demonstration of a quick sort with playing cards.

Music:
Heavenly Cows
ZmeiRaduga
http://www.jamendo.com/en/album/28834

Category:

Education

Tags:

• quick
• sort
• quicksort
• algorithm
• computing

[gdejohn]

@clashina No, it's not irony. Quicksort is a very efficient sorting algorithm that runs in linearithmic time on average. The method that most people use to sort a deck of cards, for example, is very similar to an algorithm called insertion sort, which runs in quadratic time on average. There isn't much of a difference between linearithmic and quadratic sorts with a very small number of items, but as that number grows, linearithmic sorts become noticeably better very quickly.

[dbgarf]

clashina is clearly not a computer scientist

[jrzzl33]

nice demonstration, but WTF IS THAT MUSIC

[davidhbrown0us]

@dn3sMusic It's reasonable to stick with one person if you're trying to demonstrate the raw number of comparisons/operations required. Generally, you don't have an infinite number of CPUs/threads available, so while the divide-and-conquer algorithms tend to be very efficient, you can still think of them as doing just one thing at a time.

[dn3sMusic]

lovin the background music. does it really make sense to demonstrate a recursive algorithm with only one person? cuz the beauty of quicksort is the "divide and conquer" approach if i'm not mistaken. so each time you divide it up, shouldn't a new person enter to handle the new thread created?

[miel69]

@siliconsurf the only random "shit" that happens is the moment you choose a pivot.

[Vindignatio]

You're vids are awesome, your background songs ...

[herby5678]

Quicksort is in Theta (n*logn) on average, only in Movements best case it is in Theta(n). Anyway - its fast.

[hernandezfa]

It's easy with these playing cards, but my teacher wants it with C++.

[siliconsurf]

what kind of random shit is this?

[pithikoulis]

this is hard to follow..