Skip to main content
SpringerLink
Log in
Book cover

Datenstrukturen und Algorithmen pp 179–208Cite as

Sortieralgorithmen

  • Chapter

  • 64 Accesses

Part of the book series: Leitfäden und Monographien der Informatik ((LMI))

Zusammenfassung

Das Sortieren einer Menge von Werten über einem geordneten Wertebereich (z.B. int,real, string), das heißt, die Berechnung einer geordneten Folge aus einer ungeordneten Folge dieser Werte, ist ein zentrales und intensiv studiertes algorithmisches Problem. Sortieralgorithmen haben viele direkte Anwendungen in der Praxis, finden aber auch häufig Einsatz als Teilschritte in Algorithmen, die ganz andere Probleme lösen. So betrachtet z.B. der Algorithmus Kruskal aus Abschnitt 5.2 Kanten in der Reihenfolge aufsteigender Kosten; implizit haben wir dazu bereits einen Sortieralgorithmus eingesetzt, nämlich Heapsort. Auch für die Plane-Sweep- und Divide-and-Conquer-Algorithmen im nächsten Kapitel ist Sortieren eine wesentliche Voraussetzung.

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   54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Literaturhinweise

  • Knuth, D.E. [ 1973 ]. The Art of Computer Programming, Vol. 3: Sorting and Searching. Addison-Wesley Publishing Co., Reading, Massachusetts.

    Google Scholar 

  • Knuth, D.E. [ 1973 ]. The Art of Computer Programming, Vol. 3: Sorting and Searching. Addison-Wesley Publishing Co., Reading, Massachusetts.

    Google Scholar 

  • Steinhaus, H. [ 1958 ]. One Hundred Problems in Elementary Mathematics. Problem 52. Pergamon Press, London.

    Google Scholar 

  • Shell, D.L. [ 1959 ]. A High-Speed Sorting Procedure. Communications of the ACM 2, 30–32.

    Article  Google Scholar 

  • Kronrod, M.A. [ 1969 ]. An Optimal Ordering Algorithm Without a Field of Operation. Dokladi Akademia Nauk SSSR 186, 1256–1258.

    MathSciNet  Google Scholar 

  • Huang, B.C. und M.A. Langston [ 1988 ]. Practical In-Place Merging. Communications of the ACM 31, 348–352.

    Article  Google Scholar 

  • Hibbard, T.N. [ 1962 ]. Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting. Journal of the ACM 9, 13–28.

    Article  MathSciNet  MATH  Google Scholar 

  • Sedgewick, R. [1978]. Quicksort. Garland Publishing Co., New York. Sedgewick, R. [ 1992 ]. Algorithmen. Addison-Wesley Publishing Co., Bonn.

    Google Scholar 

  • Pardo, L.T. [ 1977 ]. Stable Sorting and Merging With Optimal Space and Time Bounds. SIAM Journal on Computing 6, 351–372.

    Article  MathSciNet  MATH  Google Scholar 

  • Wegner, L. [ 1985 ]. Quicksort for Equal Keys. IEEE Transactions on Computers C-34, 362–366.

    Google Scholar 

  • Williams, J.W.J. [ 1964 ]. Algorithm 232: Heapsort. Communications of the ACM 7, 347–348.

    Google Scholar 

  • Floyd, R.W. [ 1964 ]. Algorithm 245, Treesort 3. Communications of the ACM 7, 701.

    Article  Google Scholar 

  • Doberkat, E.E. [ 1984 ]. An Average Case Analysis of Floyd’s Algorithm to Construct Heaps. Information and Control 61, 114–131.

    Article  MathSciNet  MATH  Google Scholar 

  • Dijkstra, E.W. [ 1982 ]. Smoothsort, an Alternative for Sorting in Situ. Science of Computer Programming 1, 223–233. Siehe auch: Errata, Science of Computer Programming 2 (1985), 85.

    Google Scholar 

  • Wegener, I. [ 1990a ]. Bottom-Up-Heapsort, a New Variant of Heapsort Beating on Average Quicksort (If n Is Not Very Small). Proceedings of the 15th International Conference on Mathematical Foundations of Computer Science, Banská Bystrica, Czechoslovakia, 516–522.

    Google Scholar 

  • Wegener, I. [ 1990b ]. Bekannte Sortierverfahren und eine Heapsort-Variante, die Quick-sort schlägt. Informatik-Spektrum 13, 321–330.

    Google Scholar 

  • Carlsson, S. [ 1987 ]. A Variant of Heapsort With Almost Optimal Number of Comparisons. Information Processing Letters 24, 247–250.

    Article  MathSciNet  MATH  Google Scholar 

  • Ford, L.R., und S.M. Johnson [ 1959 ]. A Tournament Problem. American Mathematical Monthly 66, 387–389.

    Article  MathSciNet  MATH  Google Scholar 

  • Schmitt, A. [ 1983 ]. On the Number of Relational Operators Necessary to Compute Certain Functions of Real Variables. Acta Informatica 19, 297–304.

    Article  MathSciNet  MATH  Google Scholar 

  • BenOr, M. [ 1983 ]. Lower Bounds for Algebraic Computation Trees. Proceedings of the 15th Annual ACM Symposium on Theory of Computing, Boston, Massachusetts, 80–86.

    Google Scholar 

  • Knuth, D.E. [ 1973 ]. The Art of Computer Programming, Vol. 3: Sorting and Searching. Addison-Wesley Publishing Co., Reading, Massachusetts.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FernUniversität Hagen, Deutschland

    Prof. Dr. rer. nat. Ralf Hartmut Güting

Authors
  1. Prof. Dr. rer. nat. Ralf Hartmut Güting
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1992 B. G. Teubner Stuttgart

About this chapter

Cite this chapter

Güting, R.H. (1992). Sortieralgorithmen. In: Datenstrukturen und Algorithmen. Leitfäden und Monographien der Informatik. Vieweg+Teubner Verlag. https://doi.org/10.1007/978-3-322-92105-5_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-322-92105-5_6

  • Publisher Name: Vieweg+Teubner Verlag

  • Print ISBN: 978-3-519-02121-6

  • Online ISBN: 978-3-322-92105-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation