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 middle element of the merged
array.

I think it could also be done in O(log m + log n + log p), where m, n,p are
lengths of the arrays.

Correct me if m wrong :)
Sanju
:)



On Sun, Aug 21, 2011 at 10:34 AM, Puneet Chawla
<puneetchawla...@gmail.com>wrote:

> 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.com>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 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 :   6,9,12,15,18
>>             arr3 :  2,4,14,20
>> output : 7 , as if we merge the arrays in sorted order then 7 will be the
>> middle element of that merged array.
>> note : if merged array is of even length then there will be two middle
>> element.
>>
>> ALSO YOU CANNOT USE EXTRA MEMORY.
>>
>>
>> --
>>   best wishes!!
>>     Vaibhav
>>
>>
>> --
>> You received this message because you are subscribed to the Google Groups
>> "Algorithm Geeks" group.
>> To post to this group, send email to algogeeks@googlegroups.com.
>> To unsubscribe from this group, send email to
>> algogeeks+unsubscr...@googlegroups.com.
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>
>
>
> --
> With regards
>   ............
> Puneet Chawla
> Computer Engineering Student
> NIT Kurukshetra
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Reply via email to