Monthly Archives: January 2021

How exactly to do linear time quickselect with duplicate elements?

It’s well known that the quickselect algorithm, which runs in average case linear time, can be made linear time in the worst case as well, by using the median of medians strategy to select the pivot. This also allows us … Continue reading

Posted in Uncategorized | 1 Comment