The number of bit comparisons used by Quicksort: an average-case analysis

Details The number of bit comparisons used by Quicksort: an average-case analysis The number of bit comparisons used by Quicksort: an average-case analysis

2012-02-13

arxiv.org/abs/1202.2595v1

Mathematics

Probability

Scientific paper

The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and so count the number of bit comparisons. On the other hand, the standard analyses of many other algorithms (such as Quicksort) are performed in terms of the number of key comparisons. We introduce the prospect of a fair comparison between algorithms of the two types by providing an average-case analysis of the number of bit comparisons required by Quicksort. Counting bit comparisons rather than key comparisons introduces an extra logarithmic factor to the asymptotic average total. We also provide a new algorithm, "BitsQuick", that reduces this factor to constant order by eliminating needless bit comparisons.

Affiliated with

Also associated with

No associations

Rating

The number of bit comparisons used by Quicksort: an average-case analysis 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 The number of bit comparisons used by Quicksort: an average-case analysis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The number of bit comparisons used by Quicksort: an average-case analysis will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-680772