Average-case analysis of multiple Quickselect: An algorithm for finding order statistics

Janice Lent and Hosam M. Mahmoud

Statistics & Probability Letters, 1996, vol. 28, issue 4, 299-310

Abstract: We analyze multiple Quickselect (MQS), a variant of Quicksort designed to search for several order statistics simultaneously. We show that, when p is an integer fixed with respect to n, the size of the data set, MQS requires an average of (2Hp + 1)n - 8p ln n + O(1) comparisons to find p order statistics, where Hp is the pth harmonic number.

Keywords: Sorting; Analysis; of; algorithms; Selection; of; order; statistics; Random; binary; search; tree (search for similar items in EconPapers)
Date: 1996
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0167-7152(95)00139-5
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:stapro:v:28:y:1996:i:4:p:299-310

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Statistics & Probability Letters is currently edited by Somnath Datta and Hira L. Koul

More articles in Statistics & Probability Letters from Elsevier
Bibliographic data for series maintained by Catherine Liu ().