Find the Minimum length Unsorted Subarray, sorting which makes the complete array sorted

04 Jun 2019

void printUnsorted(int arr[], int n)
{
	int s = 0, e = n - 1, i, max, min;

	for (s = 0; s < n - 1; s++)
	{
		if (arr[s] > arr[s + 1])
		{
			break;
		}
	}
	if (s == n - 1)
	{
		System.out.println("The complete array is sorted");
		return;
	}

	for (e = n - 1; e > 0; e--)
	{
		if (arr[e] < arr[e - 1])
		{
			break;
		}
	}

	max = arr[s];
	min = arr[s];
	for (i = s + 1; i <= e; i++)
	{
		if (arr[i] > max)
		{
			max = arr[i];
		}
		if (arr[i] < min)
		{
			min = arr[i];
		}
	}

	for (i = 0; i < s; i++)
	{
		if (arr[i] > min)
		{
			s = i;
			break;
		}
	}

	for (i = n - 1; i >= e + 1; i--)
	{
		if (arr[i] < max)
		{
			e = i;
			break;
		}
	}

	System.out.println(" The unsorted subarray which" +
			" makes the given array sorted lies" +
			" between the indices " + s + " and " + e);
	return;
}