Introduction to Algorithm Analysis (2)

Michael L. Littman

September 4th, 1997

• EFFICIENCY ANALYSIS
  • Review
  • Explaining the Growth Rates
  • Measuring Time
  • Algorithms as a Science
  • Experiment vs. Theory
  • Direct Route
  • Counting Iterations
  • Fun With Logarithms
  • Iteration Count for Russian
• RECURSION
  • Recursive Russian
  • Discussion
  • Concrete Example
  • Exponentiation
  • Divide and Conquer
  • Analysis
  • A Recurrence Relation
  • Induction Proof
  • About Proofs
  • Summary
• GREATEST COMMON DIVISOR
  • Problem Definition [Step 0]
  • Modulus
  • Naive Algorithm
  • Analysis of Naive
  • Worst-Case Analysis
  • Euclid's Algorithm
  • Example
  • Correctness
  • Efficiency Analysis
• HOMEWORK 1