Big-O Analysis

• Common Orders of Magnitude

• • O(1) is called bounded time
  • • Assigning a value to the ith element in an array of N elements
  • O(log2N) is called logarithmic time
  • • Algorithms that successively cut the amount of data to be processed in half at each step typically fall into this category
    • Finding a value in a list of sorted elements using the binary search algorithm is O(log2N)