Merge Sort vs Quick Sort

A demonstration of merge sort and a two round competition between merge sort and quick sort.

[sebastianmorataboada]

"hey dude what sports do u watch"
me: *_sweats nervously_*

thx my folks for the correction

[pelerflyp]

“Instead of relying on miracles...”
Bogo sort: 😥

[ihavetwofaces]

I’ve seen multiple visualizations, code implementations, and descriptions of Merge sort before now. I still had almost no understanding of the core mechanic. After watching this video, I understand it perfectly, and see now how simple it is. This is a fantastic visualization. Thank you!

[CocoTheMii]

This is actually a really good way of explaining sorting methods.

[GretgorPooper]

I skipped class, and now I'm cheering on cute little robots running sorting algorithms. What the hell is wrong with my life?

[LetsPlayKradnium]

I watched "We are number one but every "one" is replaced by a sorting algorithm" and now this is all I get in my recommended box

[Kneedragon]

When introduced to the common sorts, we saw animated demonstrations much like this, with various data set sizes. With small groups, bubble sort is actually quite good. Go to 100+ in a group, and suddenly you see why it's called quicksort. With small groups, quicksort doesn't seem all that clever, but when the group size goes up, it gets very much better.

[Muffinlicioification]

the little sound that the balls make when being pushed back on the shelf is satisfying

[WeevilLover]

You know you reached the peak of entertainment when you make videos of sorting robots battling while you narrate it with the voice of someone in a child's learning program

[deyannick]

Studying computer sciences, I wished I had seen this video before, didn't really understand merge sort only by code, but this makes everything perfectly clear!

[Uejji]

The nice thing about quicksort is that once the nth pivot is correctly positioned, a 2^n-1 additional robots can be brought in to help with the sorting. As long as they stay partitioned by the positioned pivots, they will not interfere with each other.

(This of course approximates parallelized sorting using quicksort)

[HallidayASR]

<3
I was cheering on Merge sort during the match hahaha

[TheRealTRackard]

What an odd way to teach programming concepts.

[whyttea]

One of a better explanations I could find online. Great job. Thank you guys!

[huyphamuc]

it's 2019 and I finally found a channel that animates algorithms in such an easy way. Subbed

[campbellmcternan]

Video: *was uploaded 5 years ago*
YouTube algorithm 2019: *Oooooh yeah he’ll love this randomly*

[Alex-dnjq]

Windows defragmenter uses merge sort. But instead of having a second shelf (or, in this case, disk) it moves files to the end of the partition, separating them using the empty space between them. That's why a good defragment process requires lots of free space.

[vicktorioalhakim]

I'd favor using merge sort over quick sort, simply because of the deterministic behavior. In one of my projects, I use sorting in a real-time system. Ensuring deterministic behavior is essential for estimating the performance and execution times of tasks.

[JTX]

instead of hoping for miracle, it indirectly implies to bogo

[OneDirection]

I’m so glad I found this channel. Makes me fall in love with Programming all over again when I’m losing hope