| | | | | |

Algorithm Complexity

  • Stated in terms of Big O, Big Omega, or Big Theta
  • Independent of hardware
  • Independent of programming language
  • Steps:
    1. n = some measure of size of input to the algorithm
    2. find an atomic notion of computational activity to count
    3. find f(n) = the number of atomic activities done by the algorithm for input of size n
    4. complexity of algorithm <= O(f(n)) (or >= Ω(f(n)) or = Θ(f(n)))

| | Top of Page | 3. Introduction to Algorithm Analysis - 16 of 23