Subj : Re: how can i do this in o(n)
To   : comp.programming
From : Sc0rpi0
Date : Thu Sep 15 2005 12:54 am

lanka.kamal@gmail.com:

> 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

mergesort


-- 
Sc0rpi0
I hated going to weddings.
All the grandmas would poke me saying "You're next".
They stopped that when I started doing it to them at funerals.

.