See this document in CiteSeerX!

Optimal Sampling Strategies in Quicksort and Quickselect (1998)  (Make Corrections)  
Conrado Martínez, Salvador Roura



  Home/Search   Context   Related

 
View or download:
lsi.upc.es/~conrado/...LSI981R.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  lsi.upc.es/~conrado/re...techreps (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: It is well known that the performance of quicksort can be substantially improved by selecting the median of a sample of three elements as the pivot of each partitioning stage. This variant is easily generalized to samples of size s = 2k + 1. For large samples the partitions are better as the median of the sample makes a more accurate estimate of the median of the array to be sorted, but the amount of additional comparisons and exchanges to find the median of the sample also increases. (Update)

Similar documents (at the sentence level):
77.8%:   Optimal Sampling Strategies in Quicksort and Quickselect - -->, Roura (1998)   (Correct)

Active bibliography (related documents):   More   All
0.4:   Analysis of Quickfind with small subfiles - Martínez, Panario, Viola   (Correct)
0.4:   Improved Master Theorems for Divide-and-Conquer Recurrences - Roura (2000)   (Correct)
0.4:   An Improved Master Theorem for Divide-and-Conquer Recurrences - Roura (1998)   (Correct)

Similar documents based on text:   More   All
0.9:   Transitional Behaviors of the Average Cost of Quicksort With.. - Chern, Hwang (2001)   (Correct)
0.7:   Analysis Of Hoare's Find Algorithm With.. - Kirschenhofer.. (1995)   (Correct)
0.6:   Quickselect and Dickman function - Hwang, Tsai (2001)   (Correct)

BibTeX entry:   (Update)

@misc{ martinez-optimal,
  author = "Conrado Mart\'inez and Salvador Roura",
  title = "Optimal Sampling Strategies in Quicksort and Quickselect",
  url = "citeseer.ist.psu.edu/516857.html" }
Citations (may not include all citations):
442   Concrete Mathematics (context) - Graham, Knuth et al. - 1989
157   The Art of Computer Programming: Sorting and Searching (context) - Knuth - 1973
108   Communications of the ACM (context) - Hoare, Algorithm - 1961
108   An Introduction to the Analysis of Algorithms (context) - Sedgewick, Flajolet - 1996
97   Computer Journal (context) - Hoare - 1962
61   Expected time bounds for selection (context) - Floyd, Rivest - 1975
22   Implementing quicksort programs (context) - Sedgewick - 1978
21   Software--- Practice and Experience (context) - Bentley, McIlroy et al. - 1993
20   The analysis of quicksort programs (context) - Sedgewick - 1976
17   Computer and System Sciences (context) - Blum, Floyd et al. - 1973
16   Analysis of quickselect: An algorithm for order statistics (context) - Mahmoud, Modarres et al. - 1995
14   Analysis of Hoare's Find algorithm with median-of-three part.. - Kirschenhofer, Prodinger et al. - 1997
9   Handbook of Algorithms and Data Structures - In Pascal and C (context) - Gonnet, Baeza-Yates - 1991
8   An improved master theorem for divide-and-conquer recurrence.. - Roura - 1997
7   Optimal sampling strategies for quicksort (context) - McGeoch, Tygar - 1995
4   Divide-and-Conquer Algorithms and Data Structures (context) - Roura - 1997
4   Hoare's Find algorithm (context) - Anderson, Brown et al. - 1992
2   Algorithm 347: An efficient algorithm for sorting with minim.. (context) - Singleton - 1969

Documents on the same site (http://www.lsi.upc.es/~conrado/research/techreps.html):   More
Average-case Analysis of Equality of Binary Trees Under the.. - Martínez (1994)   (Correct)
A Top-Down Design of a Parallel Dictionary using Skip.. - Gabarro.. (1994)   (Correct)
On the Number of Descendants and Ascendants in Random.. - Martínez.. (1997)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC