engineering recuitment NIC NIELIT Scientist B 2023 Mock Test Algorithms Searching, Sorting and Hashing Sorting
Suppose a modified merge sort is implemented on an unsorted array of ānā elements. This modified merge sort divide the array into three equal parts. Sort each part merge all three parts. What would be the time complexity of this modified merge sort?
1
O(n2)
2
O(n3)
3
O(n log n)
4
O(n2 log n)