Analyzing Merge Sort Algorithm

• To establish growth order
  • Drop the lower-order term n
  • Drop the constant factor 5
  • Drop the base of the logarithm since
    all logarithms are related by a constant factor
  • We are left with n log(n)
• Using big-Oh notation: number of visits is O(nlog(n))