Algorithms
20%
off

Algorithms

4.36 (1,023 ratings by Goodreads)
By (author)  , By (author) 

Free delivery worldwide

Available. Dispatched from the UK in 3 business days
When will my order arrive?

Not expected to be delivered to the United States by Christmas Not expected to be delivered to the United States by Christmas

Description

This fourth edition of Robert Sedgewick and Kevin Wayne's Algorithms is the leading textbook on algorithms today and is widely used in colleges and universities worldwide. This book surveys the most important computer algorithms currently in use and provides a full treatment of data structures and algorithms for sorting, searching, graph processing, and string processing--including fifty algorithms every programmer should know. 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 algorithms in this book 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, not to mention students who use computation in the liberal arts. 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 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. Offered each fall and spring, this course regularly attracts tens of thousands of registrants. 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 textbook, online content, and MOOC, all at the state of the art, they have built a unique resource that greatly expands the breadth and depth of the educational experience.show more

Product details

  • Hardback | 992 pages
  • 182.88 x 238.76 x 38.1mm | 1,451.49g
  • Pearson Education (US)
  • Addison-Wesley Educational Publishers Inc
  • New Jersey, United States
  • English
  • 4th edition
  • w. figs.
  • 032157351X
  • 9780321573513
  • 51,822

About Robert Sedgewick

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).show more

Table of contents

Preface viii Chapter 1: Fundamentals 31.1 Basic Programming Model 81.2 Data Abstraction 641.3 Bags, Queues, and Stacks 1201.4 Analysis of Algorithms 1721.5 Case Study: Union-Find 216 Chapter 2: Sorting 2432.1 Elementary Sorts 2442.2 Mergesort 2702.3 Quicksort 2882.4 Priority Queues 3082.5 Applications 336 Chapter 3: Searching 3613.1 Symbol Tables 3623.2 Binary Search Trees 3963.3 Balanced Search Trees 4243.4 Hash Tables 4583.5 Applications 486 Chapter 4: Graphs 5154.1 Undirected Graphs 5184.2 Directed Graphs 5664.3 Minimum Spanning Trees 6044.4 Shortest Paths 638 Chapter 5: Strings 6955.1 String Sorts 7025.2 Tries 7305.3 Substring Search 7585.4 Regular Expressions 7885.5 Data Compression 810 Chapter 6: Context 853 Index 933List of Algorithms 954List of Clients 955show more

Rating details

1,023 ratings
4.36 out of 5 stars
5 53% (547)
4 33% (336)
3 11% (111)
2 2% (23)
1 1% (6)
Book ratings by Goodreads
Goodreads is the world's largest site for readers with over 50 million reviews. We're featuring millions of their reader ratings on our book pages to help you find your new favourite book. Close X