Concept of algorithm and notion of algorithm efficiency
Assessing the time/space efficiency of a algorithms through measurement [Shared with AL]
Best, Average, and Worst case algorithmic behavior
Complexity Classes: Constant, logarithmic, linear, quadratic, cubic, and exponential, P, NP, and NPC
Analysis of iterative and recursive algorithms
Explain the use of Big-O, Omega, and Theta notation to describe the amount of work done by an algorithm
Explain what is meant by “best”, “expected”, and “worst” case behavior of an algorithm