What makes an algorithm fastLesson 7 of 11

Ω, Θ, and why cases are a different question

A floor under the duplicate check and both bounds on the reading loop. Best and worst case each get their own O, Ω and Θ.

Locked

Unlock the rest of Algorithms and Data Structures: what everything costs.

  • Every lesson, every resource, unlocked instantly.
  • Track progress and pick up where you left off.
  • Free preview lessons stay readable from the outline.

From

BDT 0

Enrol now