Skip to content

Further structures and analysis

Asymptotic analysis

Lessons on this topic

Intermediate · 25 minYou are hereRead

Asymptotic notation

O, Ω 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 hereRead

Recurrences

The 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.

Phasorium

Account

Sign inWith Google, GitHub or your email

Subjects

Site

Look