1. A(n) __________ sort is a sorting algorithm that is used when the collection of data will not fit in the computers main memory all at once, but must reside on secondary storage such as a disk..

a. external b. internal c. sort d. none of the choices apply

2. The quicksort is ______ in the worst case. a. O(n2) b. O(log2 n) c. O(n * log2 n) d. O(n3)

3. Given the following array: 4 15 8 3 28 21 which of the following represents the array after the second swap of the selection sort? a. 4 3 8 15 21 28 b. 4 15 8 3 21 28 c. 3 4 8 15 21 28 d. 21 4 3 8 15 28 4. A merge sort operation runs in: a. O(log n) time. b. O(n) time. c. O(n log n) time. d. O(n2) time.