CS100A Lecture 26

• Previous Lecture

  • More inheritance:
  • super
  • introduction to graphics

• This Lecture

  • Analysis of algorithms and their complexity

Time Complexity

Space Complexity

• Asymptotic Complexity
• (Worst, Best, Average) Case Analysis
• Examples:
  • Sequential Search vs. Binary Search
  • Selection Sort vs. Merge Sort
• Recursion

Next slide

Back to first slide

View graphic version