Question entretien chez Google : Merge k sorted int arrays, each array containing n ints, into 1 array. And give the complexity.

Google

Merge k sorted int arrays, each array containing n ints, into 1 array. And give the complexity.

Utilisateur anonyme

13 juil. 2012

K way merge with heap is a solution. The time complexity is nklog(k)

Utilisateur anonyme

5 juil. 2012

Loser Tree is a solution. The time complexity is O(n*k*log(k)).