Analyzing the Performance of the Selection Sort Algorithm

• The number of visits is of the order n²
• Using big-Oh notation: The number of visits is O(n²)
• Multiplying the number of elements in an array by 2 multiplies the processing time by 4
• Big-Oh notation "f(n) = O(g(n))"
  expresses that f grows no faster than g
• To convert to big-Oh notation:
  locate fastest-growing term, and ignore constant coefficient