Intermediate · 25 minYou are hereReadAsymptotic notationO, Ω and Θ bound a cost from above, from below and from both sides, for all large n, and every claim of cost in this course is one of them.
Intermediate · 25 minYou are hereReadRecurrencesThe cost of a recursive algorithm is a recurrence, and summing its recursion tree level by level shows whether the root, the leaves or every level dominates.