@sanjay - shouldnt we use count instead of second k. and when count
becomes size/2,we get the element becouse we dont know the array in which
that element resides
correct me if m wrong??
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
in the solution I proposed, k is doing the job of count. I think u should
look at it again.
Sanju
:)
On Mon, Aug 22, 2011 at 1:42 AM, tanuj chawla houndhun...@gmail.com wrote:
@sanjay - shouldnt we use count instead of second k. and when count
becomes size/2,we get the element becouse
given three sorted arrays not necessary of same length (length is given)
we have to determine the middle element such that the element will be the
middle one of the such an array which will be formed if all three given
arrays are merged in
sorted order.
input :- arr1 : 1,3,5,7
arr2
Here by just applying merge on these array as they are sorted and calculate
the middle element..Am i rt..???
On Sun, Aug 21, 2011 at 10:59 PM, vaibhav shukla vaibhav200...@gmail.comwrote:
given three sorted arrays not necessary of same length (length is given)
we have to determine the middle
Take three pointers to the beginning of each array say i,j,k.
Now let sum = len a +len b + len c.
k=0
now start from the beginning, compare elements at indexes i,j,k.
which ever is smaller, increment that index and k, continue till k becomes
sum/2.
when k becomes sum/2, this element will be
@puneet : but u cant use extra memory
On Sun, Aug 21, 2011 at 11:08 PM, Sanjay Rajpal srn...@gmail.com wrote:
Take three pointers to the beginning of each array say i,j,k.
Now let sum = len a +len b + len c.
k=0
now start from the beginning, compare elements at indexes i,j,k.
which ever
ohh sryy i didn't read tht
On Sun, Aug 21, 2011 at 11:09 PM, vaibhav shukla vaibhav200...@gmail.comwrote:
@puneet : but u cant use extra memory
On Sun, Aug 21, 2011 at 11:08 PM, Sanjay Rajpal srn...@gmail.com wrote:
Take three pointers to the beginning of each array say i,j,k.
Now let
@sanjay : yes this is one approach . just doing this and keeping track of
the smaller element and wen k is sum/2, the minimum element of the middle on
true. but any other approach apart from this and wat if the total length is
even, i.e u have to give two middle elements then
On Sun, Aug 21,
@sanjay why you have compared k with sum/2 is it a general solution..???
On Sun, Aug 21, 2011 at 11:11 PM, vaibhav shukla vaibhav200...@gmail.comwrote:
@sanjay : yes this is one approach . just doing this and keeping track of
the smaller element and wen k is sum/2, the minimum element of the
see sum is total no.of elements in three arrays.
the question is middle element in the merged array.
so the middle element would be at index sum/2.
Sanju
:)
On Sun, Aug 21, 2011 at 10:46 AM, Puneet Chawla
puneetchawla...@gmail.comwrote:
@sanjay why you have compared k with sum/2 is it a
http://stackoverflow.com/questions/6182488/median-of-5-sorted-arrays this
link will help m damn sure.
Sanju
:)
On Sun, Aug 21, 2011 at 10:48 AM, Sanjay Rajpal srn...@gmail.com wrote:
see sum is total no.of elements in three arrays.
the question is middle element in the merged array.
so
11 matches
Mail list logo
