Skip to content
Topic

Algorithms

Materials found: 5

  • Big Theta: a tight growth order

    How two constant-factor bounds establish an order without numerical equality.

    Read article
    Algorithms
  • Big Omega: a lower growth bound

    How to show a function eventually stays above a chosen growth scale.

    Read article
    Algorithms
  • Big O: an upper growth bound

    How a constant factor and a threshold define an asymptotic upper bound.

    Read article
    Algorithms
  • Little o: negligible relative growth

    Why a ratio tending to zero is stronger than an ordinary upper bound.

    Read article
    Algorithms
  • Asymptotic equivalence

    When two functions differ by a vanishing relative fraction.

    Read article
    Algorithms