Subj : Re: how can i do this in o(n)
To   : comp.programming
From : Richard Heathfield
Date : Wed Sep 14 2005 06:51 am

lanka.kamal@gmail.com said:

> A given array of size 2n with n elements in sorted order. Another array
> with size n & n elements in it in sorted order. Merge the two arrays &
> final array should be in sorted order without using extra memory

See my answer in comp.lang.c to the same question, which you (incorrectly) 
multiposted to that group.

-- 
Richard Heathfield
"Usenet is a strange place" - dmr 29/7/2005
http://www.cpax.org.uk
email: rjh at above domain

.