GATE | CS | 2019 | Algorithms | Searching & Sorting | Question 46

Last Updated :
Discuss
Comments

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 ________ . 

Ο(n log n)

Ο(n2)

Ο(n)

Ω(n2log n)

This question is part of this quiz :

GATE CS 2019,Algorithms GATE CS PYQ Quiz,Searching & Sorting GATE CS PYQ Quiz
Tags:
GATE
Algorithms
GATE CS
Share your thoughts in the comments