QUIZ 2 SOLUTION
    1. 4
    2. 0 3 7 8 1
    3. A[4] A[4] and A[1]
    4. 0 1 3 8 7
    1. 10
    2. 10
    3. 10
    4. n-1
    1. O(n2)
    2. True 
    Pass 1:	LastExchangeIndex 5	List:	7 3 0 8 10 1 12
Pass 2:	LastExchangeIndex 4	List:	3 7 0 8 1 10 12
Pass 3:	LastExchangeIndex 3	List:	0 3 7 1 8 10 12
    1. 4
    2. Pass 1: List 3 7 0 8 1
Pass 2: List 0 3 7 8 1 
Pass 3: List 0 3 7 8 1
    1. 4
    2. 10
    What is the computational complexity of the insertion sort for
    1. O(n2)
    2. O(n2)
    3. O(n)
    1. 20
    2. 5 and 55
    3. 1
    4. 5 20 65 80 65 55 90 100
  7. A sublist has one element
  8. The pivot is the smallest element all of the time
  9. The elements are in ascending order
    1. O(n*log2n)
    2. O(n2)
    3. O(n*log2n)
  11. selection
  12. selection
  13. Converts a search key into an index
  14. True
  15. True
    1. 561 124 736 987 316 203 426
    2. 561
    3. 987 203 736