Subj : Re: how can i do this in o(n)
To   : comp.programming
From : Randy Howard
Date : Fri Sep 16 2005 05:20 pm

lanka.kamal@gmail.com wrote
(in article 
<1126670601.508853.48710@g14g2000cwa.googlegroups.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

Actually attending class, staying awake during it, and reading 
the textbook is probably the best thing for this one.


-- 
Randy Howard (2reply remove FOOBAR)

.