Quick Sort vs Merge Sort

preview_player
Показать описание
Comparison of Quick and Merge sorting algorithms in various cases.
Quick sort benefits from randomized data, while Merge sort seems to be better on average.
Quick sort seems to be quicker in real life usage, when unstable sorting isn't an issue.
Merge sort is widely used stable sorting algorithm, when there's additional RAM for storing temporary list of merged sets.
Рекомендации по теме
Комментарии
Автор

useless because no 'piuw piuw wuuuooiiii wuuooiiii' sound

oktay
Автор

cool, any explanation as to why it happens?

Draxper
Автор

You did quick sort dirty by using a poorly written version of it

Hayernator