Subj : Re: how can i do this in o(n) To : comp.programming From : amorgan Date : Fri Sep 16 2005 11:18 am In article <1126670601.508853.48710@g14g2000cwa.googlegroups.com>, wrote: >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 That's a cute puzzle. Thanks for posting it. I won't post my solution because I don't want to deny other people the pleasure of solving it. Alan -- Defendit numerus .