Grokking algorithms

Exercises solutions and other notes while reading the book.

Errata page.

Chapters

• Chapter 1: Introduction to algorithms
  • Introduction
  • Binary search
  • Big O notation

Chapter 2: Selection sort.

• How memory works
• Arrays and linked lists
• Selection sort

Chapter 3: Recursion

• Recursion
• Base case and recursive case
• The stack

Chapter 4: Quicksort

• Divide & conquer
• Quicksort
• Big O notation revisited

Chapter 5: Hash tables

• Hash functions
• Use cases
• Collisions
• Performance