Use inplace merging algorithm. But it's a bit complicated. On Nov 13, 6:50 pm, MAC <macatad...@gmail.com> wrote: > you have an array of size n where first n/2 is sorted and the sencond half > is sorted . You need to sort the entire array inplace > > Its second modification version is where first part is sorted and other is > NOT sorted . You need to make entire sorted . > -- > thanks > --mac
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@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.
