This fourth edition of Robert Sedgewick and Kevin Wayne’s Algorithms is one of the best textbooks today on algorithms 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.
About the authors
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. His research interests include analytic combinatorics, design and analysis of data structures and algorithms, and program visualization.
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.
This fourth edition of Robert Sedgewick and Kevin Wayne’s Algorithms is one of the best textbooks today on algorithms 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.
About the authors
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. His research interests include analytic combinatorics, design and analysis of data structures and algorithms, and program visualization.
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.