Multiple Choice
The behavior of merge sort is ____ in the worst case and ____ in the average case.
A) O(nlog2n) , O(nlog2n)
B) O(n2) , O(n)
C) O(nlog2n) , O(n2)
D) O(n2) , O(nlog2n)
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q13: Let f be a function of n.By
Q14: We can trace the execution of a
Q15: The formula to find the index of
Q16: The swap function of quick sort is
Q17: The binary search algorithm can be written
Q19: In a bubble sort for list of
Q20: In a bubble sort, the smaller elements
Q21: During the sorting phase of insertion sort,
Q22: Assuming the following list declaration, which element
Q23: In a binary search, first, the search