This book teaches important computer algorithms by asking the reader to solve competitive programming problems.  Dr. Daniel Zingaro uses programs and challenges that are drawn from real programming competitions to illustrate how to make use of data structures and algorithms. Topics covered include hash tables, recursion, dynamic programming, trees, graphs, and heaps, and how to choose and implement the best solutions for any coding challenge. The code examples are written in C and designed for clarity and accessibility.

<ASIN:1718503229>

Author: Dr. Daniel Zingaro
Publisher: No Starch
Date: January 2024
Pages: 480
ISBN: 978-1718503229
Print: 1718503229
Kindle: B0BZGZHK3B
Audience: General
Level: Introductory/Intermediate
Category: Methodology

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.