CS100A Lecture 27

• Previous 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

• This Lecture

  • What can be computed?
  • What can not be computed?
  • Can human capabilities be matched?

Next slide

Back to first slide

View graphic version