engineering recuitment GATE CSE 2023-24 Test Series Algorithms Asymptotic Worst Case Time and Time Complexity Introduction
A recursive algorithm is designed in such a way that it is divided into three sub-problems of size in the ratio [ 7 : 2 : 9 ] and a non-comparison based sorting algorithm is to be used to merge the results obtained by the subproblems (that the result are of a small range < n). Which of the following describes the time complexity of such an algorithm?
1
O(n2 log n )
2
O(n log log n )
3
O(n3 log n )
4
O(n log n)