Partitioning schemes for quicksort and quickselect

Details Partitioning schemes for quicksort and quickselect Partitioning schemes for quicksort and quickselect

2003-12-23

arxiv.org/abs/cs/0312054v1

Computer Science

Data Structures and Algorithms

21 pages

Scientific paper

We introduce several modifications of the partitioning schemes used in Hoare's quicksort and quickselect algorithms, including ternary schemes which identify keys less or greater than the pivot. We give estimates for the numbers of swaps made by each scheme. Our computational experiments indicate that ternary schemes allow quickselect to identify all keys equal to the selected key at little additional cost.

Affiliated with

Also associated with

No associations

Rating

Partitioning schemes for quicksort and 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 Partitioning schemes for quicksort and quickselect, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Partitioning schemes for quicksort and quickselect will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-323032