Skip to main content
SpringerLink
Log in

Sortieren

  • Chapter
Algorithmen und Datenstrukturen mit Modula — 2

Part of the book series: Leitfäden der Informatik ((XLINF))

  • 34 Accesses

Zusammenfassung

Dieses Kapitel enthält in der Hauptsache eine ausgiebige Menge von Beispielen, die die Verwendung der im vorangehenden Kapitel behandelten Datenstrukturen erläutern und zeigen, wie stark die Wahl der Struktur der zugrundeliegenden Daten die Algorithmen beeinflusst, die eine bestimmte Aufgabe ausführen.

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

Access this chapter

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 49.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 44.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. B. K. Betz and Carter. Proc. ACM National Conf. 14, (1959), Paper 14.

    Google Scholar 

  2. R.W. Floyd. Treesort (Algorithms 113 and 243). Comm. ACM, 5, No. 8, (1962), 434, and Comm. ACM, 7, No. 12 (1964), 701.

    Google Scholar 

  3. R.L. Gilstad. Polyphase Merge Sorting — An Advanced Technique. Proc.AFIPS Eastern Jt. Comp. Conf., 18, (1960), 143–48.

    Google Scholar 

  4. C.A.R. Hoare. Proof of a Program: FIND. Comm.ACM, 13, No. 1, (1970), 39–45.

    Google Scholar 

  5. C.A.R. Hoare. Proof of a Recursive Program: Quicksort. Comp. J., 14, No. 4 (1971), 391–95.

    Article  MathSciNet  MATH  Google Scholar 

  6. C.A.R. Hoare. Quicksort. Comp J., 5. No.l (1962), 10–15.

    Article  MathSciNet  MATH  Google Scholar 

  7. D.E. Knuth. The Art of Computer Programming. Vol. 3 (Reading, Mass.: Addison-Wesely, 1973).

    Google Scholar 

  8. C.A.R. Hoare. The Art of Computer Programming. Vol 3, pp. 86–95.

    Google Scholar 

  9. C.A.R. Hoare. The Art of Computer Programming. Vol 3, p. 289.

    Google Scholar 

  10. H. Lorin. A Guided Bibliography to Sorting. IBM SystJ., 10, No. 3 (1971), 244–54.

    Article  Google Scholar 

  11. D.L. Shell. A Highspeed Sorting Procedure. Comm. ACM, 2, No. 7 (1959), 30–32.

    Article  Google Scholar 

  12. R.C. Singleton. An Efficient Algorithm for Sorting with Minimal Storage (Algorithm 347). Comm. ACM, 12, No. 3 (1969), 185.

    Article  Google Scholar 

  13. M. H. Van Emden. Increasing the Efficiency of Quicksort (Algorithm 402). Comm. ACM, 13, No. 9 (1970), 563–66, 693.

    Article  MATH  Google Scholar 

  14. J.WJ. Williams. Heapsort (Algorithm 232). Comm. ACM, 7, No. 6 (1964), 347–48.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technischen Hochschule Zürich, Schweiz

    Dr. Dr. h.c. mult. Niklaus Wirth (Professor an der Eidg.)

Authors
  1. Dr. Dr. h.c. mult. Niklaus Wirth
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1986 B. G. Teubner Stuttgart

About this chapter

Cite this chapter

Wirth, N. (1986). Sortieren. In: Algorithmen und Datenstrukturen mit Modula — 2. Leitfäden der Informatik. Vieweg+Teubner Verlag. https://doi.org/10.1007/978-3-322-91855-0_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-322-91855-0_2

  • Publisher Name: Vieweg+Teubner Verlag

  • Print ISBN: 978-3-519-12260-9

  • Online ISBN: 978-3-322-91855-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation