What makes an algorithm fastLesson 6 of 11

Big-O as a promise: find c and n₀

3n² + 10n + 5 is in O(n²) with c = 4 and n₀ = 11, while c = 3 never works. And why no c puts n² in O(n).

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