Grokking Algorithms shows that learning algorithms doesn't have to be complicated or boring. In this revised second edition, Aditya Bhargava introduces brand new coverage of trees, including binary search trees, balanced trees, and B-trees. This edition also offers fresh insights on data structure performance that takes account of modern CPUs. Plus, the book’s fully annotated code samples have been updated to Python 3.

<ASIN:1633438538 >

Author: Aditya Bhargava
Publisher: Manning
Date: March 2024
Pages: 320
ISBN: 978-1633438538
Print: 1633438538
Kindle: ‎ B0CW1G5D2N
Audience: General
Level: Intermediate
Category: Methodology

Topics include:

• Search, sort, and graph algorithms
• Data structures such as arrays, lists, hash tables, trees, and graphs
• NP-complete and greedy algorithms
• Performance trade-offs between algorithms
• Exercises and code samples in every chapter
• Over 400 illustrations with detailed walkthroughs

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.