Lecture 02 - Time Complexity

Notation Best case → Omega Notation - Ω Describes the minimum time the algorithm could take. example: Linear Search - Ω(1) Average case → Theta Notation - Θ Describes the tight bound - when best and worst cases grow the same. Traversing an arra...