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?
@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.
At least this video IS quicksort. There are a bunch of videos that AREN'T. Anyway the term is Big O. Quicksort improves exponentially over basic sorting methods. Wikipedia - "on average, makes O(nlogn) (big O notation) comparisons to sort n items. In the worst case, it makes O(n2) comparisons." The thing that was hard to learn was that it uses arbitrary pivots. People flirted with selective pivots for a while, but Quicksort, while adequate. Is outdated.
This was a good demonstration. The only issue is that you would have to assume or identify the pivot at the very beginning of the video which was 8 of Diamonds.
@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.
nice demonstration, but WTF IS THAT MUSIC
jrzzl33 2 months ago
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?
dn3sMusic 5 months ago
@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.
davidhbrown0us 4 months ago
You're vids are awesome, your background songs ...
Vindignatio 6 months ago
Quicksort is in Theta (n*logn) on average, only in Movements best case it is in Theta(n). Anyway - its fast.
herby5678 8 months ago
Comment removed
herby5678 8 months ago
It's easy with these playing cards, but my teacher wants it with C++.
hernandezfa 10 months ago 3
what kind of random shit is this?
siliconsurf 11 months ago
@siliconsurf the only random "shit" that happens is the moment you choose a pivot.
miel69 6 months ago
this is hard to follow..
pithikoulis 1 year ago
At least this video IS quicksort. There are a bunch of videos that AREN'T. Anyway the term is Big O. Quicksort improves exponentially over basic sorting methods. Wikipedia - "on average, makes O(nlogn) (big O notation) comparisons to sort n items. In the worst case, it makes O(n2) comparisons." The thing that was hard to learn was that it uses arbitrary pivots. People flirted with selective pivots for a while, but Quicksort, while adequate. Is outdated.
FriendlyNewt 1 year ago
i am fucking faster to sort 13 diamond cards, then quicksort :D
slatz20 1 year ago
clashina is clearly not a computer scientist
dbgarf 1 year ago 12
This was a good demonstration. The only issue is that you would have to assume or identify the pivot at the very beginning of the video which was 8 of Diamonds.
Mesmereyes 1 year ago
@Mesmereyes The pivot is always identified as the first card that gets flipped. In this case it was 8, but it would have worked for any card.
KennyKudda 1 year ago
is this irony or something, because that was the slowest sort I've ever seen
clashina 1 year ago
@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.
gdejohn 1 year ago 14