GATE CS 2019 – Question 37

Multiple choice 2 marks Question 37 2019

Question 37

MCQ 2 marks · −0.66 Algorithms

There are \(n\) unsorted arrays: \(A_1, A_2, \ldots, A_n\). Assume that \(n\) is odd. Each of \(A_1, A_2, \ldots, A_n\) 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 \(A_1, A_2, \ldots, A_n\) is

Answers and explanations are free — they just need an account.

Where this question comes from

GATE CS — Computer Science & IT 2019 Algorithms

Source: GATE 2019 Computer Science and Information Technology, Q37 (question number approximate)

All Algorithms questions