Algorithms

Series
Addison-Wesley
Author
Robert Sedgewick / Kevin Wayne  
Publisher
Addison-Wesley
Cover
Softcover
Edition
4
Language
English
Total pages
896
Pub.-date
March 2011
ISBN13
9780321573513
ISBN
032157351X
Related Titles


Product detail

Product Price CHF Available  
9780321573513
Algorithms
98.30

Description

This fourth 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.
The companion web site, algs4.cs.princeton.edu, contains:

  • An online synopsis
  • Full Java implementations
  • Test data
  • Exercises and answers
  • Dynamic visualizations
  • Lecture slides
  • Programming assignments with checklists
  • Links to related material

The MOOC related to this book is accessible via the "Online Course" link at algs4.cs.princeton.edu. The course, offered each fall and spring, offers more than 100 video lecture segments that are integrated with the text, extensive online assessments, and the large-scale discussion forums that have proven so valuable.


Robert Sedgewick and Kevin Wayne are developing a modern approach to disseminating knowledge that fully embraces technology, enabling people all around the world to discover new ways of learning and teaching. By integrating their state-of-the-art textbook, online content, and MOOC, they have built a unique resource that greatly expands the breadth and depth of the educational experience.

Features

  • The #1 practical resource for everyone seeking to run programs faster or solve larger problems
  • Surveys today's most useful algorithms, with copious illustrations and examples
  • Contains many new examples, ranging from physics, biology, and engineering to data compression and web search
  • Contains real (not pseudocode) implementations, with detailed performance insights
  • A companion web site, algs4.cs.princeton.edu , with many more resources for instructors, including text digests, program code, test data, programming projects, exercises, lecture slides, and other resources

New to this Edition

  • Many powerful new algorithms
  • A broader perspective with more science and engineering applications
  • New illustrations and examples throughout
  • An attractive new two-color design
  • A companion web site, algs4.cs.princeton.edu , with many more resources for instructors, including text digests, program code, test data, programming projects, exercises, lecture slides, and other resources

  • Table of Contents

    Preface viii

     

    Chapter 1: Fundamentals 3

    1.1 Basic Programming Model 8

    1.2 Data Abstraction 64

    1.3 Bags, Queues, and Stacks 120

    1.4 Analysis of Algorithms 172

    1.5 Case Study: Union-Find 216

     

    Chapter 2: Sorting 243

    2.1 Elementary Sorts 244

    2.2 Mergesort 270

    2.3 Quicksort 288

    2.4 Priority Queues 308

    2.5 Applications 336

     

    Chapter 3: Searching 361

    3.1 Symbol Tables 362

    3.2 Binary Search Trees 396

    3.3 Balanced Search Trees 424

    3.4 Hash Tables 458

    3.5 Applications 486

     

    Chapter 4: Graphs 515

    4.1 Undirected Graphs 518

    4.2 Directed Graphs 566

    4.3 Minimum Spanning Trees 604

    4.4 Shortest Paths 638

     

    Chapter 5: Strings 695

    5.1 String Sorts 702

    5.2 Tries 730

    5.3 Substring Search 758

    5.4 Regular Expressions 788

    5.5 Data Compression 810

     

    Chapter 6: Context 853

     

    Index 933

    List of Algorithms 954

    List of Clients 955

    Author

    Robert Sedgewick has been a Professor of Computer Science at Princeton University since 1985, where he was the founding Chairman of the Department of Computer Science. He has held visiting research positions at Xerox PARC, Institute for Defense Analyses, and INRIA, and is member of the board of directors of Adobe Systems. Professor Sedgewick's research interests include analytic combinatorics, design and analysis of data structures and algorithms, and program visualization. His landmark book, Algorithms, now in its fourth edition, has appeared in numerous versions and languages over the past thirty years. In addition, with Kevin Wayne, he is the coauthor of the highly acclaimed textbook, Introduction to Programming in Java: An Interdisciplinary Approach (Addison-Wesley, 2008).

     

    Kevin Wayne is the Phillip Y. Goldman Senior Lecturer in Computer Science at Princeton University, where he has been teaching since 1998. He received a Ph.D. in operations research and industrial engineering from Cornell University. His research interests include the design, analysis, and implementation of algorithms, especially for graphs and discrete optimization. With Robert Sedgewick, he is the coauthor of the highly acclaimed textbook, Introduction to Programming in Java: An Interdisciplinary Approach (Addison-Wesley, 2008).