Mathematics – Probability
Scientific paper
2007-06-16
Mathematics
Probability
32 pages, 1 figure
Scientific paper
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 of key comparisons required by the algorithms but also in terms of the number of bit comparisons. Some of the standard sorting and searching algorithms have been analyzed with respect to key comparisons but not with respect to bit comparisons. In this paper, we investigate the expected number of bit comparisons required by Quickselect (also known as Find). We develop exact and asymptotic formulae for the expected number of bit comparisons required to find the smallest or largest key by Quickselect and show that the expectation is asymptotically linear with respect to the number of keys. Similar results are obtained for the average case. For finding keys of arbitrary rank, we derive an exact formula for the expected number of bit comparisons that (using rational arithmetic) requires only finite summation (rather than such operations as numerical integration) and use it to compute the expectation for each target rank.
Fill James Allen
Nakama Take
No associations
LandOfFree
Analysis of the expected number of bit comparisons required by Quickselect does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Analysis of the expected number of bit comparisons required by Quickselect, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Analysis of the expected number of bit comparisons required by Quickselect will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-468417