Please gave right answer only The worst case with 6 keys for the best possible s
ID: 3551556 • Letter: P
Question
Please gave right answer only
The worst case with 6 keys for the best possible sorting algorithm among those whose only access to input data is by comparisons, i.e., the exact lower bound for comparison-based sorting of 6 keys. 10 17 7 21 The worst case for the BUILD-HEP phase of HEAPSROT when creating a heap of 7 keys. (i.e. on 7 keys with A[i] = i for i= l,..., 7 ) 7 6 4 8 The sorting phase of HEAPSORT - the loop that occurs after BUILD-HEAP has been done - on 7 keys with A[i] = i for i= l,..., 7. (You will need to figure out what happens during BUILD-HEAP first, but don't count those comparisons.) 13 10 10 8 The sorting phase of HEAPSORT- the loop that occurs after BUILD-HEAP has been done - requires how many key comparisons in the worst case to finish sorting 7 keys if the array elements begin that phase in descending order (for example, the i-th element is 7-i+l)? 11 10 12 24 MERGESORT with 8 keys requires how many comparisons in the worst case? Recall that MERGE requires (i+j-1) comparisons in the worst case to merge two lists of length i and j. 17 16 24 15 INSERTIONSORT when sorting four l's followed by four 0's - the result should be four 0's followed by four l's like 00001111. 22 19 28 16Explanation / Answer
1. C
2. C
3. D
4. D
5. D
6. C