Skip to main content
SpringerLink
Log in
Book cover

Grundkurs Informatik pp 469–522Cite as

Suchen und Sortieren

  • Chapter
  • First Online:

  • 14k Accesses

Zusammenfassung

Dieses Kapitel behandelt zwei der grundlegendsten Verfahren der Informatik, nämlich das Suchen und Sortieren von Daten. Zur Vertiefung wird auf die einschlägige Literatur verwiesen, z. B. [Knu98, Ott12, Sed11, Cor09, Sol08, Pom08, Wir00].

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   29.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.

Literatur

  • [Boy77] R. S. Boyer und J. S. Moore. A Fast String Searching Algorithm. Commun. ACM, 20(10):762–772, Okt. 1977.

    Article  Google Scholar 

  • [Cor09] T. H. Cormen, C. E. Leiserson, R. L. Rivest und C. Stein. Introduction to Algorithms. The MIT Press, 3. Aufl., 2009.

    Google Scholar 

  • [Hoa62] C. A. R. Hoare. Quicksort. The Computer Journal, 5(1):10–16, 1962.

    Article  MATH  MathSciNet  Google Scholar 

  • [Knu77] D. E. Knuth, J. H. Morris und V. R. Pratt. Fast Pattern Matching in Strings. SIAM J. Comput., 6:323–350, 1977.

    Article  MathSciNet  Google Scholar 

  • [Knu98] D. E. Knuth. The Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesley, 2. Aufl., 1998.

    Google Scholar 

  • [Lev66] V. Levenshtein. Binary Codes Capable of Correcting Deletions, Insertions, and Reversals. Soviet Physics Doklady, 10(8):707–710, 1966.

    Google Scholar 

  • [Oku76] T. Okuda, E. Tanaka und T. Kasai. A Method for the Correction of Garbled Words Based on the Levenshtein Metric. IEEE Transactions on Computers, C-25(2):172–178, Feb 1976.

    Google Scholar 

  • [Ott12] T. Ottmann und P. Widmayer. Algorithmen und Datenstrukturen. Spektrum Akademischer Verlag, 5. Aufl., 2012.

    Google Scholar 

  • [Pom08] G. Pomberger und H. Dobler. Algorithmen und Datenstrukturen: Eine systematische Einführung in die Programmierung. Pearson Studium, 2008.

    Google Scholar 

  • [Sed11] R. Sedgewick und K. Wayne. Algorithms. Addison-Wesley, 4. Aufl., 2011.

    Google Scholar 

  • [She59] D. L. Shell. A High-speed Sorting Procedure. Commun. ACM, 2(7):30–32, Juli 1959.

    Article  Google Scholar 

  • [Sol08] A. Solymosi und U. Grude. Grundkurs Algorithmen und Datenstrukturen in JAVA. Vieweg+ Teubner, 4. Aufl., 2008.

    Google Scholar 

  • [Wir00] N. Wirth. Algorithmen und Datenstrukturen. Vieweg+Teubner, 5. Aufl., 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Hochschule Rosenheim, Rosenheim, Deutschland

    Hartmut Ernst, Jochen Schmidt & Gerd Beneken

Authors
  1. Hartmut Ernst
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jochen Schmidt
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gerd Beneken
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hartmut Ernst .

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer Fachmedien Wiesbaden

About this chapter

Cite this chapter

Ernst, H., Schmidt, J., Beneken, G. (2015). Suchen und Sortieren. In: Grundkurs Informatik. Springer Vieweg, Wiesbaden. https://doi.org/10.1007/978-3-658-01628-9_12

Download citation

Publish with us

Policies and ethics

Search

Navigation