C++ Program for Shortest Un-ordered Subarray
Last Updated :
26 May, 2022
An array is given of n length, and problem is that we have to find the length of shortest unordered {neither increasing nor decreasing} sub array in given array.
Examples:
Input : n = 5
7 9 10 8 11
Output : 3
Explanation : 9 10 8 unordered sub array.
Input : n = 5
1 2 3 4 5
Output : 0
Explanation : Array is in increasing order.
The idea is based on the fact that size of shortest subarray would be either 0 or 3. We have to check array element is either increasing or decreasing, if all array elements are in increasing or decreasing, then length of shortest sub array is 0, And if either the array element is not follow the increasing or decreasing then it shortest length is 3.
C++
#include <bits/stdc++.h>
using namespace std;
bool increasing( int a[], int n)
{
for ( int i = 0; i < n - 1; i++)
if (a[i] >= a[i + 1])
return false ;
return true ;
}
bool decreasing( int a[], int n)
{
for ( int i = 0; i < n - 1; i++)
if (a[i] < a[i + 1])
return false ;
return true ;
}
int shortestUnsorted( int a[], int n)
{
if (increasing(a, n) == true ||
decreasing(a, n) == true )
return 0;
else
return 3;
}
int main()
{
int ar[] = { 7, 9, 10, 8, 11 };
int n = sizeof (ar) / sizeof (ar[0]);
cout << shortestUnsorted(ar, n);
return 0;
}
|
Time complexity: O(n) where n is the length of the array.
Auxiliary Space: O(1)
Please refer complete article on Shortest Un-ordered Subarray for more details!
Share your thoughts in the comments
Please Login to comment...