Chapter 1 References
Chapter 1 References
The sources below support the topics in Chapter 1. The chapter pages explain the mechanisms; this page collects the shared books and websites used to verify their definitions, operations, and costs.
Books
| Source | Topics |
|---|---|
| Introduction to Algorithms | Arrays, linked lists, stacks, queues, hashing, probabilistic structures, and asymptotic analysis |
| Algorithms, 4th Edition | Data-structure implementations, correctness, and complexity analysis |
| Grokking Algorithms | Intuitive introductions to data structures and probabilistic counting |
| The Algorithm Design Manual | Design tradeoffs, data-structure selection, and practical implementation guidance |
Websites
| Source | Topics |
|---|---|
| GeeksforGeeks | Dynamic arrays, linked lists, stacks, queues, hash tables, Bloom filters, HyperLogLog, Count-Min Sketch, and expression evaluation |
| Algorithms, 4th Edition Resources | Reference implementations and analysis exercises |