Nothing Special   »   [go: up one dir, main page]

skip to main content
10.5555/982792.982856acmconferencesArticle/Chapter ViewAbstractPublication PagessodaConference Proceedingsconference-collections
Article

Adaptive sampling for quickselect

Published: 11 January 2004 Publication History

Abstract

Quickselect with median-of-3 is largely used in practice and its behavior is fairly well understood. However, the following natural adaptive variant, which we call proportion-from-3, had not been previously analyzed: choose as pivot the smallest of the sample if the rank of the sought element is small, the largest if the rank is large, and the median if the rank is medium". We first analyze proportion-from-2 and then proportion-from3. We also analyze ν-find, a generalization of proportion-from-3 with interval breakpoints at ν and 1 -- ν. We show that there exists an optimal value of ν and we also provide the range of values of ν where ν-find outperforms median-of-3. Our results atrongly suggest that a suitable implementation of this variant could be the method of choice in a practical setting. Finally, we also show that proportion-from-s and similar strategies are optimal when s → ∞

References

[1]
D. Anderson and R. Brown. Combinatorial aspects of C. A. R. Hoare's FIND algorithm. Australasian Journal of Combinatorics, 5:109--119, 1992.
[2]
R. Floyd and R. Rivest. Expected time bounds for selection. Communications of the ACM, 18(3):165--173, 1975.
[3]
R. Grübel. On the median-of-k version of Hoare's selection algorithm. Theoretical Informatics and Applications, 33(2):177--192, 1999.
[4]
R. Grübel and U. Rösler. Asymptotic distribution theory for Hoare's selection algorithm. Adv. Appl. Prob., 28:252--269, 1996.
[5]
C. Hoare. FIND (Algorithm 65). Communications of the ACM, 4:321--322, 1961.
[6]
C. Hoare. Quicksort. Computer Journal, 5:10--15, 1962.
[7]
P. Kirschenhofer, H. Prodinger, and C. Martínez. Analysis of Hoare's Find algorithm with median-of-three partition. Random Structures & Algorithms, 10(1):143--156, 1997.
[8]
D. Knuth. Mathematical analysis of algorithms. In Information Processing '71, Proc. of the 1971 IFIP Congress, pages 19--27, Amsterdam, 1972. North-Holland.
[9]
D. Knuth. The Art of Computer Programming: Sorting and Searching, volume 3. Addison-Wesley, Reading, Mass., 2nd edition, 1998.
[10]
H. Mahmoud. Sorting: A Distribution Theory. John Wiley & Sons, New York, 2000.
[11]
C. Martínez and S. Roura. Optimal sampling strategies in quicksort and quickselect. SIAM Journal on Computing, 31(3):683--705, 2001.
[12]
D. Musser. Introspective sorting and selection algorithms. Software---Practice and Experience, 27(8):983--993, 1997.
[13]
E. Rainville, P. Bedient, and R. Bedient. Elementary Differential Equations. Prentice Hall, 8th edition, 1997.

Cited By

View all
  1. Adaptive sampling for quickselect

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    SODA '04: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
    January 2004
    1113 pages
    ISBN:089871558X

    Sponsors

    Publisher

    Society for Industrial and Applied Mathematics

    United States

    Publication History

    Published: 11 January 2004

    Check for updates

    Qualifiers

    • Article

    Acceptance Rates

    Overall Acceptance Rate 411 of 1,322 submissions, 31%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)3
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 17 Nov 2024

    Other Metrics

    Citations

    Cited By

    View all

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media