engineering recuitment ISRO Scientist Computer Science Mock Test Algorithms Asymptotic Worst Case Time and Time Complexity Introduction
There are n unsorted arrays: A1, A2, ..., An. Assume that n is odd. Each of A1, A2, ..., An contains n distinct elements. There are no common elements between any two arrays. The worst-case time complexity of computing the median of the medians of A1, A2, ..., An is
1
O(n)
2
O(n log n)
3
O(n2)
4
Ω(n2log n)