you can sort them(in O(n log n)) then find it . this is O(nlog n)
or you can use "selection problem" ,by this you can solve it in O(n) ! look at
the chapter Medians and Order Statistics in CLRS book,,
--- On Thu, 7/22/10, Tech Id wrote:
From: Tech Id
Subject: [algogeeks] find k-th maximum in
i think ,you can use the idea of merg (merg sort)
--- On Mon, 7/19/10, manish bhatia wrote:
From: manish bhatia
Subject: Re: [algogeeks] a google question
To: algogeeks@googlegroups.com
Date: Monday, July 19, 2010, 5:03 PM
Given two sorted postive integer arrays A(n) and B(n) (W.L.O.G, let's
s
