Big-O Analysis

• • O(N2) is called quadratic time
  • • Algorithms of this type typically involve applying a linear algorithm N times. Most simple sorting algorithms are O(N2) algorithms
  • O(2N) is called exponential time