http://www.geeksforgeeks.org/archives/8858

On 24 November 2011 01:06, Ankuj Gupta <[email protected]> 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 [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.
>
>


-- 
Regards
Kumar Raja
M.Tech(SIT)
IIT Kharagpur,
[email protected]

-- 
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.

Reply via email to