Book
Grokking Algorithms
An illustrated guide to algorithms and data structures — 2nd edition.
Currently Reading
chapters 6 / 13
-
Chapter 1: Introduction to Algorithms
Binary search, Big O notation, and what it means for an algorithm to be efficient — notes and exercises from Chapter 1 of Grokking Algorithms.
-
Chapter 2: Selection Sort
Arrays vs Linked Lists — trade-offs in reading, insertion, and deletion — plus the Selection Sort algorithm. Notes and exercises from Chapter 2 of Grokking Algorithms.
-
Chapter 3: Recursion
Recursion, base cases, and recursive cases — notes from Chapter 3 of Grokking Algorithms.
-
Chapter 4: Divide and Conquer
Divide and conquer, quicksort, Lomuto partitioning, inductive proofs, and Big O revisited — notes from Chapter 4 of Grokking Algorithms.