Big-O Analysis

• • O(N) is called linear is called linear time
  • • Printing all the elements in a list of N elements is O(N)
  • O(N log2N)
  • • Algorithms of this type typically involve applying a logarithmic algorithm N times
    • The better sorting algorithms, such as Quicksort, Heapsort, and Mergesort, have N log2N complexity