Polynomial Time Taking Algorithms
  - Linear Search O(n)
  - Binary Search O(logn)
  - Matrix Mul O(n^x)
  - Insertion Sort O(n^2)
  - Merge Sort nlogn



Exponential Time Taking Algorithms {*=rough range }
  - 0/1 Knapsack O(2^n)
  - Travelling salesman O(2^n)
  - Sum of Subsets O(2^n)
  - Graph Coloring O(2^n)
  - Hamilton Cycle  O(2^n)