This book claims to combine rigor and comprehensiveness. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein cover a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers, with self-contained chapters and algorithms in pseudocode. This comprehensive update has new material on matchings in bipartite graphs, online algorithms, machine learning, and other topics.

<ASIN:026204630X>

Author: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein
Publisher: MIT Press
Date: April 2022
Pages: 1312
ISBN: 978-0262046305
Print: 026204630X
Kindle: B09XJBVNQR
Audience: general
Level: Intermediate
Category: Theory & Techniques 

Mike James gave the previous (2009) edition of this book a top 5-star rating. See his full review and for recommendations of similar books see our round-up on our Programmer's Bookshelf section

For more Book Watch just click.

Book Watch is I Programmer's listing of new books and is compiled using publishers' publicity material. It is not to be read as a review where we provide an independent assessment. Some, but by no means all, of the books in Book Watch are eventually reviewed.

To have new titles included in Book Watch contact  BookWatch@i-programmer.info

Follow @bookwatchiprog on Twitter or subscribe to I Programmer's Books RSS feed for each day's new addition to Book Watch and for new reviews.