Skip to main content
SpringerLink
Log in
Book cover

Workshop on Algorithm Engineering and Experimentation

ALENEX 2002: Algorithm Engineering and Experiments pp 194–205Cite as

An Improvement on Tree Selection Sort

  • Conference paper
  • First Online:

  • 606 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2409))

Abstract

The standard Tree Selection Sort is an efficient sorting algorithm but requires extra storage for n-1 pointers and n items. The goal of this paper is to not only reduce the extra storage of Tree Selection Sort to n bits, but also keep the number of comparisons at nlogn+O(n). The improved algorithm makes at most 3n data movements. The empirical results show that the improved algorithm is efficient. In some cases, say moving one item requires at least 3 assignment operations, the algorithm is the fastest on average among known fast algorithms.

This work was partially done while the author served in Shanghai Jiaotong University, China, and partially supported by the National Natural Science Foundation of China grant

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.W.J. Williams, Algorithm 232, Heapsort 3, Comm.ACM, 7, 1964, pp. 347–348.

    Google Scholar 

  2. R.W. Floyd, Algorithm 245, Treesort 3, Comm.ACM, 1964, p. 701.

    Google Scholar 

  3. C.A.R. Hoare, Algorithm 63,64 and 65, Comm.ACM, 4(7), 1961,pp. 321–322.

    Article  Google Scholar 

  4. E.H. Friend, Sorting on electronic computers, JACM 3(2), 1956, pp. 34–168.

    Google Scholar 

  5. D.E. Knuth, “The Art of Computer Programming Vol.3: Sorting and Searching”, Addison-Wesley, Reading, MA, 1973

    Google Scholar 

  6. I. Wegener, The worst case complexity of McDiarmid and Reed’s variant of Bottom-Up heapsort is less than nlogn+1.1n, information and computation, 97, 1992, pp. 86–96.

    Article  MATH  MathSciNet  Google Scholar 

  7. C.J.H. McDiarmid and B.A. Reed, Building heaps fast, J. Algorithms 10, pp. 352–369.

    Google Scholar 

  8. S. Carlsson, A variant of heapsort with almost optimal number of comparisons, Inform. Process. Lett. 24, pp. 247–250.

    Google Scholar 

  9. G.H. Gonnet and J.I. Munro, Heaps on heaps, Proc. 9th ICALP, Aarhus, Denmark, July 12–16, 1982,pp. 282–291.

    Google Scholar 

  10. R.D. Dutton, Weak-heap sort, BIT 33, 1993,pp. 372–381.

    Article  MathSciNet  Google Scholar 

  11. J.C. Chen, Proportion split sort, Nordic Journal of Computing 3(1996), pp. 271–279.

    Google Scholar 

  12. J.C. Chen, Proportion extend sort, SIAM Journal on Computing, Vol. 31, No. 1, 2001, pp. 323–330.

    Article  MATH  MathSciNet  Google Scholar 

  13. A. LaMarca and R.E. Lader, The influence of Caches on the performance of sorting, J. Algorithms 31, 1999, pp. 66–104.

    Article  MATH  MathSciNet  Google Scholar 

  14. R. Sedgewick, Implementing quicksort programs. Communications of the ACM, 21(10), pp. 847–857, October, 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bell Labs Research China, Lucent Technologies, 3/F, Aero Space Great Wall Building No.30, Hai Dian Nan Lu, Beijing, 100080, P.R.China

    Jingchao Chen

Authors
  1. Jingchao Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Maryland, College Park, MD, 20742, USA

    David M. Mount

  2. Department of IEOR, Columbia University, 500W. 120 St., MC 4704, New York, NY, 10027, USA

    Clifford Stein

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, J. (2002). An Improvement on Tree Selection Sort. In: Mount, D.M., Stein, C. (eds) Algorithm Engineering and Experiments. ALENEX 2002. Lecture Notes in Computer Science, vol 2409. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45643-0_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-45643-0_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43977-6

  • Online ISBN: 978-3-540-45643-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation