Pearson unterstützt die Ukraine. Wir stehen hinter allen Ukrainerinnen und Ukrainern. Mehr erfahren >>
Wird geladen …
Robert Sedgewick, Kevin Wayne

Algorithms

Auflage 4

This edition of Robert Sedgewick and Kevin Wayne’s Algorithms is one of the most popular textbooks on algorithms today and is widely used in colleges and universities worldwide. The algorithms in this book – including 50 algorithms every programmer should know – represent a body of knowledge developed over the last 50 years that has become indispensable, not just for professional programmers and computer science students but for any student with interests in science, mathematics, and engineering and for students who use computation in the liberal arts. In this edition, new Java implementations are written in an accessible modular programming style, where all of the code is exposed to the reader and ready to use.

  • eBook (PDF)
    54,56 €
  • Buch
    81,31 €

Produktdetails

Verlagsnummer: 9780321573513
ISBN: 978-0-321-57351-3
Produkttyp: Buch
Verlag: Pearson International
Erscheinungsdatum: 24.03.2011
Seiten: 976
Vorgängertitel: 9780321713179, 9780201361216
Auflage: 4
Sprache: Englisch

Artikelbeschreibung

The leading introduction to computer algorithms in use today, including fifty algorithms every programmer should know

Princeton Computer Science professors, Robert Sedgewick and Kevin Wayne, survey the most important computer algorithms in use and of interest to anyone working in science, mathematics, and engineering, and those who use computation in the liberal arts. They provide a full treatment of data structures and algorithms for key areas that enable you to confidently implement, debug, and put them to work in any computational environment.

 Fundamentals:

  • Basic programming models
  • Data abstraction
  • Bags, queues, and stacks
  • Analysis of algorithms

 Sorting

  • Elementary sorts
  • Mergesort
  • Quicksort
  • Priority queues
  • Applications

 Graphs

  • Undirected graphs
  • Directed graphs
  • Minimum spanning trees
  • Shortest paths

Strings

  • String sorts
  • Tries
  • Substring search
  • Regular expressions
  • Data compression

These algorithms are generally ingenious creations that, remarkably, can each be expressed in just a dozen or two lines of code. As a group, they represent problem-solving power of amazing scope. They have enabled the construction of computational artifacts, the solution of scientific problems, and the development of commercial applications that would not have been feasible without them.

Produktfinder