Q417
What is the average time complexity of in place merge sort when we use the following function for merging? void in_place_merge(int arr[], int l, int middle, int r) int start2 = middle + 1; if (arr[middle] <= arr[start2]) return; while (l <= middle && start2 <= r) if (arr[l] <= arr[start2]) l++; else int val = arr[start2]; int index = start2; while (index != l) arr[index] = arr[index - 1]; index--; arr[l] = val; l++; middle++; start2++;
A.
O(n log n)
B.
O(n2)
AnswerC.
O(n2 log n)
D.
O(n log n2)
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board