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.
