First determine the point from which array becomes decreasing. Then In-place merge sort.
On 14 December 2010 23:22, divya <[email protected]> wrote: > Given an array of size n wherein elements keep on increasing > monotically upto a certain location > after which they keep on decreasing monotically, then again keep on > increasing, then decreasing > again and so on. Sort the array in place (ie. using only O(1) extra > memory). > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- regards, soumya prasad ukil -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
