Asymptotic Analysis Summary

• Determine what characterizes a problem’s size

• Express how much resources (time, memory, etc.) an algorithm requires as a function of input size using O(•), ?(•), ?(•)

  • worst case
  • best case
  • average case
  • common case
  • overall

Previous slide

Next slide

Back to first slide

View graphic version