i have posted this problem along with solution to my blog check : http://code-forum.blogspot.com/2010/12/find-minimum-length-unsorted-subarray.html
On Dec 18, 10:57 pm, snehal jain <learner....@gmail.com> wrote: > Given an unsorted array arr[0..n-1] of size n, find the minimum length > subarray arr[s..e] such that sorting this subarray makes the whole > array sorted. -- 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.
