A Common-Sense Guide to Data Structures and Algorithms in Python, Volume 2 (Pragmatic Bookshelf) |
Wednesday, 22 October 2025 | |||
This book covers advanced data structures and algorithms, exploring the efficiency of algorithms, and of data structures such as B-trees, bit vectors, and Bloom filters. Jay Wengrow shows how to use techniques like caching, randomization, and fingerprinting, using simple language, clear diagrams, and practice exercises and solutions. This Python edition uses Python exclusively for all code examples, exercises, and solutions. <ASIN: B0DXN5SQCV >
Author: Jay Wengrow For recommendations of books on data science see Reading Your Way Into Big Data in our Programmer's Bookshelf section. For recommendations of Python books see Books for Pythonistas and Python Books For Beginners in 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.
|