[prev] 10 [next]

Algorithmic Complexity (cont)

Algorithms are "rated" by their complexity class.

Thus we might say "quicksort has worst case complexity O(n2) "

Assigning an algorithm to a complexity class ...

  • determine cost g(n) as function of input size n
  • associate g(n) with appropriate complexity class

Want to know everything ... try the Big-O Cheat Sheet