algorithms_unlocked_study_guide

Collaborative study guide for “Algorithms Unlocked.” by Thomas H. Cormen.

Index

1. What Are Algorithms and Why Should You Care?
2. How to Describe and Evaluate Computer Algorithms
3. Algorithms for Sorting and Searching
4. A Lower Bound for Sorting and How to Beat It
5. Directed Acyclic Graphs
6. Shortest Paths
7. Algorithms on Strings
8. Foundations of Cryptography
9. Data Compression
10. Hard? Problems

Useful Notes to survive the book

• Big-O Cheatsheet