undefined | Better HN

0 pointsjorgemf8y ago0 comments

> On average case data where no patterns are detected pdqsort is effectively a quicksort that uses median-of-3 pivot selection

So basically is quicksort with a bit more clever pivot selection, but only for some cases.

0 comments

_hrfd8y ago

You're forgetting probably the most important optimization: block partitioning. This one alone makes it almost 2x faster (on random arrays) than typical introsort when sorting items by an integer key.

j / k navigate · click thread line to collapse

0 pointsjorgemf8y ago0 comments

> On average case data where no patterns are detected pdqsort is effectively a quicksort that uses median-of-3 pivot selection

So basically is quicksort with a bit more clever pivot selection, but only for some cases.

0 comments

_hrfd8y ago

j / k navigate · click thread line to collapse