Analysis of Quickselect Under Yaroslavskiy’s Dual-Pivoting Algorithm

  title={Analysis of Quickselect Under Yaroslavskiy’s Dual-Pivoting Algorithm},
  author={Sebastian Wild and Markus E. Nebel and Hosam Mahmoud},
There is excitement within the algorithms community about a new partitioning method introduced by Yaroslavskiy. This algorithm renders Quicksort slightly faster than the case when it runs under classic partitioning methods. We show that this improved performance in Quicksort is not sustained in Quickselect; a variant of Quicksort for finding order statistics. We investigate the number of comparisons made by Quickselect to find a key with a randomly selected rank under Yaroslavskiy’s algorithm… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS