/coursera_stanford_algo

Primary LanguageRuby

Coursera Stanford Algorithms

Code-along with Stanford's Algorithms: Design and Analysis, Part 1 on Coursera

Week 1

  • Introduction
  • Asymptotic Analysis
  • Divide and Conquer Algorithms

Week 2

  • The Master Method
  • Quicksort
  • Probability Review

Week 3

  • Probability Review
  • Linear-time Selection
  • Graphs and the Contraction Algorithm

Week 4

  • Graph Search and Connectivity

Week 5

  • Dijkstra's Shortest-Path Algorithm
  • Heaps
  • Balanced Binary Search Trees

Week 6

  • Hashing: The Basics
  • Universal Hashing
  • Bloom Filters

Preview of Part 2 Algorithms: Design and Analysis, Part 2