Previous Lecture | lect11 | Next Lecture |
Topics
- Formal Big O - formula and graphical presentation
- Complexity classes - constant, logarithmic, exponential, linear, quadratic, cubic
- Best case, worst case, average case
- Example algorithms
- Binary search in sorted arrays
- Analysis of BST operations