Search Results

3 results for “algorithms”

Formulae (3)

T(n) = aT(n/b) + f(n)

Analyzes running time of divide-and-conquer algorithms.

O(1) < O(\log n) < O(n) < O(n\log n) < O(n^2) < O(2^n)

Ordering of common algorithmic growth rates.

T(n) = aT(n/b) + f(n)

General form for analyzing divide-and-conquer recurrences.