Java Program for Check if an array is sorted and rotated
Last Updated :
27 May, 2022
Given an array of N distinct integers. The task is to write a program to check if this array is sorted and rotated counter-clockwise. A sorted array is not considered as sorted and rotated, i.e., there should at least one rotation.
Examples:
Input : arr[] = { 3, 4, 5, 1, 2 }
Output : YES
The above array is sorted and rotated.
Sorted array: {1, 2, 3, 4, 5}.
Rotating this sorted array clockwise
by 3 positions, we get: { 3, 4, 5, 1, 2}
Input: arr[] = {7, 9, 11, 12, 5}
Output: YES
Input: arr[] = {1, 2, 3}
Output: NO
Input: arr[] = {3, 4, 6, 1, 2, 5}
Output: NO
Approach:
- Find the minimum element in the array.
- Now, if the array is sorted and then rotate all the elements before the minimum element will be in increasing order and all elements after the minimum element will also be in increasing order.
- Check if all elements before minimum element are in increasing order.
- Check if all elements after minimum element are in increasing order.
- Check if the last element of the array is smaller than the starting element.
- If all of the above three conditions satisfies then print YES otherwise print NO.
Below is the implementation of the above idea:
Java
import java.io.*;
class GFG {
static void checkIfSortRotated( int arr[], int n)
{
int minEle = Integer.MAX_VALUE;
int maxEle = Integer.MIN_VALUE;
int minIndex = - 1 ;
for ( int i = 0 ; i < n; i++) {
if (arr[i] < minEle) {
minEle = arr[i];
minIndex = i;
}
}
boolean flag1 = true ;
for ( int i = 1 ; i < minIndex; i++) {
if (arr[i] < arr[i - 1 ]) {
flag1 = false ;
break ;
}
}
boolean flag2 = true ;
for ( int i = minIndex + 1 ; i < n; i++) {
if (arr[i] < arr[i - 1 ]) {
flag2 = false ;
break ;
}
}
if (minIndex == 0 ) {
System.out.print( "NO" );
return ;
}
if (flag1 && flag2 && (arr[n - 1 ] < arr[ 0 ]))
System.out.println( "YES" );
else
System.out.print( "NO" );
}
public static void main(String[] args)
{
int arr[] = { 3 , 4 , 5 , 1 , 2 };
int n = arr.length;
checkIfSortRotated(arr, n);
}
}
|
Time Complexity: O(N), where N represents the size of the given array.
Auxiliary Space: O(1), no extra space is required, so it is a constant.
Please refer complete article on Check if an array is sorted and rotated for more details!
Share your thoughts in the comments
Please Login to comment...