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++
// CPP program to find shortest subarray which is // unsorted. #include <bits/stdc++.h> using namespace std; // bool function for checking an array elements // are in increasing. 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 function for checking an array // elements are in decreasing. 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) { // increasing and decreasing are two functions. // if function return true value then print // 0 otherwise 3. if (increasing(a, n) == true || decreasing(a, n) == true) return 0; else return 3; } // Driver code int main() { int ar[] = { 7, 9, 10, 8, 11 }; int n = sizeof(ar) / sizeof(ar[0]); cout << shortestUnsorted(ar, n); return 0; } |
chevron_right
filter_none
Java
// JAVA program to find shortest subarray which is // unsorted. import java.util.*; import java.io.*; class GFG { // boolean function to check array elements // are in increasing order or not public static boolean increasing(int a[],int n) { for (int i = 0; i < n - 1; i++) if (a[i] >= a[i + 1]) return false; return true; } // boolean function to check array elements // are in decreasing order or not public static boolean decreasing(int arr[],int n) { for (int i = 0; i < n - 1; i++) if (arr[i] < arr[i + 1]) return false; return true; } public static int shortestUnsorted(int a[],int n) { // increasing and decreasing are two functions. // if function return true value then print // 0 otherwise 3. if (increasing(a, n) == true || decreasing(a, n) == true) return 0; else return 3; } // driver program public static void main (String[] args) { int ar[] = new int[]{7, 9, 10, 8, 11}; int n = ar.length; System.out.println(shortestUnsorted(ar,n)); } } // This code is contributed by Akash Singh. |
chevron_right
filter_none
Python3
# Python3 program to find shortest # subarray which is unsorted # Bool function for checking an array # elements are in increasing def increasing(a, n): for i in range(0, n - 1): if (a[i] >= a[i + 1]): return False return True # Bool function for checking an array # elements are in decreasing def decreasing(a, n): for i in range(0, n - 1): if (a[i] < a[i + 1]): return False return True def shortestUnsorted(a, n): # increasing and decreasing are two functions. # if function return True value then print # 0 otherwise 3. if (increasing(a, n) == True or decreasing(a, n) == True): return 0 else: return 3 # Driver code ar = [7, 9, 10, 8, 11] n = len(ar) print(shortestUnsorted(ar, n)) # This code is contributed by Smitha Dinesh Semwal. |
chevron_right
filter_none
C#
// Program to find the shortest // subarray which is unsorted. using System; class GFG { // boolean function to check // array elements are in the // increasing order or not public static bool increasing(int[] a, int n) { for (int i = 0; i < n - 1; i++) if (a[i] >= a[i + 1]) return false; return true; } // boolean function to check // array elements are in the // decreasing order or not public static bool decreasing(int[] arr, int n) { for (int i = 0; i < n - 1; i++) if (arr[i] < arr[i + 1]) return false; return true; } public static int shortestUnsorted(int[] a, int n) { // increasing and decreasing are // two functions. function return // true value then print 0 else 3 if (increasing(a, n) == true || decreasing(a, n) == true) return 0; else return 3; } // Driver program public static void Main() { int[] ar = new int[] { 7, 9, 10, 8, 11 }; int n = ar.Length; Console.WriteLine(shortestUnsorted(ar, n)); } } // This code is contributed by vt_m. |
chevron_right
filter_none
PHP
<?php // php program to find shortest // subarray which is unsorted. // bool function for checking an // array elements are in increasing. function increasing($a, $n) { for ( $i = 0; $i < $n - 1; $i++) if ($a[$i] >= $a[$i + 1]) return false; return true; } // bool function for checking an // array elements are in decreasing. function decreasing($a, $n) { for ($i = 0; $i < $n - 1; $i++) if ($a[$i] < $a[$i + 1]) return false; return true; } function shortestUnsorted($a, $n) { // increasing and decreasing are // two functions. if function // return true value then print // 0 otherwise 3. if (increasing($a, $n) == true || decreasing($a, $n) == true) return 0; else return 3; } // Driver code $ar = array( 7, 9, 10, 8, 11 ); $n = sizeof($ar); echo shortestUnsorted($ar, $n); // This code is contributed by // nitin mittal. ?> |
chevron_right
filter_none
Output :
3
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
Recommended Posts:
- Count unordered pairs (i,j) such that product of a[i] and a[j] is power of two
- XOR of pairwise sum of every unordered pairs in an array
- Count the number of unordered triplets with elements in increasing order and product less than or equal to integer X
- Find the missing number in unordered Arithmetic Progression
- Count of unordered pairs (x, y) of Array which satisfy given equation
- Bitwise XOR of all unordered pairs from a given array
- Shortest subarray to be removed to make all Array elements unique
- Maximize the subarray sum after multiplying all elements of any subarray with X
- Maximum length of subarray such that sum of the subarray is even
- Count of subarray that does not contain any subarray with sum 0
- Maximum length of subarray such that all elements are equal in the subarray
- First subarray having sum at least half the maximum sum of any subarray of size K
- Find shortest unique prefix for every word in a given list | Set 2 (Using Sorting)
- Pair with given sum and maximum shortest distance from end
- Shortest path to traverse all the elements of a circular array in increasing order
- D'Esopo-Pape Algorithm : Single Source Shortest Path
- Maximize shortest path between given vertices by adding a single edge
- Shortest path in a directed graph by Dijkstraâs algorithm
- Create a Graph by connecting divisors from N to M and find shortest path
- Print all possible shortest chains to reach a target word
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
Improved By : nitin mittal
