2 papers
math.PR2012
Distributional convergence for the number of symbol comparisons used by QuickSelect
James Allen Fill, Takehiko Nakama
When the search algorithm QuickSelect compares keys during its execution in order to find a key of target rank, it must operate on the keys' representations or internal structures,…
math.PR2007
Analysis of the expected number of bit comparisons required by Quickselect
James Allen Fill, Take Nakama
When algorithms for sorting and searching are applied to keys that are represented as bit strings, we can quantify the performance of the algorithms not only in terms of the number…