The selection sort algorithm repeatedly moves the smallest element from the unsorted list to the beginning of the unsorted list. a. true b. false

It can be shown that the average number of key comparisons for insertion sort is ____. a. O(n) b. O(n²) c. O(n log n) d. O(n² log n) In selection sort, suppose there is a list of length 4. How many key comparisons will be made? a. 6 b. 16 c. 32 d. 64 A heap is a list in which each element contains a key, such that the key in the element at position k in the list is at least as large as the key in the element at position 2k + 1 (if it exists), and 2k + 2 (if it exists). a. true b. false A selection sort cannot be applied to linked lists. a. true b. false