Multithreaded Sorting

Показать описание

One of the advantages to QuickSort and Mergesort is that they can be multithreaded nicely. QuickSort is tail recursive, meaning each step does some work, then passes it on to the next step, and MergeSort is head recursive, where it has the next step do the work, then adds it's work to it.

Both are very efficient sorting algorithms with great multithreading capabilities. QuickSort does suffer if it makes a poor pivot choice (I use median of first, last, and middle value). Where MergeSort has to deal with array copying.

Both visualizations are very heavially multithreaded, more so than would generally be practical in most impelmentations as the threads are not running at full speed. The visualization has 10,240 point split among up to 512 threads.

Рекомендации по теме

Комментарии

The only algorithm that beats this one, is the YouTube algorithm which suggested me this masterpiece after 9 years

mihagolod

I can hear the noise in my head. Boin, boin, boin, boooin.

manchul

Multithreading is also a key to make a pretty fast and realistic gravity sort.

pawelipkowski

So the real question is who's gonna make the next most efficient sorting algorithm

ashheilborn

Yes, you have been summoned by the algorithm to watch a video on algorithms

blueyay

12 years later and its still getting recommended

waterysad

Awesome vid but you forgot to add the earrape

legorockfan

I have no idea what any of this means but it looks cool

focusedfuture

Whenever I see these kinds of videos I always expect the god sort to show up. You know, the one that goes at the end and makes you deaf if you're wearing headphones and raised the volume because you thought it was too quiet at the start.

OhWaker