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 wrote:
> @sanjay - shouldnt we use count instead of second k. and when count
> becomes size/2,we get the element becouse we dont know the arr
@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.
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 wrote:
> see sum is total no.of elements in three arrays.
>
> the question is middle element in the merged array.
>
> so the middle el
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
wrote:
> @sanjay why you have compared k with sum/2 is it a general solution..???
>
>
>
@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 wrote:
> @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
@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, 2011
ohh sryy i didn't read tht
On Sun, Aug 21, 2011 at 11:09 PM, vaibhav shukla wrote:
> @puneet : but u cant use extra memory
>
>
> On Sun, Aug 21, 2011 at 11:08 PM, Sanjay Rajpal wrote:
>
>> Take three pointers to the beginning of each array say i,j,k.
>>
>> Now let sum = len a +len b + len c.
>>
@puneet : but u cant use extra memory
On Sun, Aug 21, 2011 at 11:08 PM, Sanjay Rajpal 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 is smaller,
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 midd
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 wrote:
> given three sorted arrays not necessary of same length (length is given)
> we have to determine the middle element such that the
u mean we have to find the median of the merged array .
Are all elements distinct ?
Sanju
:)
On Sun, Aug 21, 2011 at 10:29 AM, vaibhav shukla wrote:
> given three sorted arrays not necessary of same length (length is given)
> we have to determine the middle element such that the element will
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 :
12 matches
Mail list logo
