Big-O Analysis

• • O(n!) is called factorial time
  • • The traveling salesperson graph algorithm is a factorial time algorithm
    • Algorithms whose order of magnitude can be expressed as a polynomial in the size of the problem are called polynomial-time algorithms
    • All polynomial-time algorithms are defined as being in Class P