Skip to content
Related Articles

Related Articles

Improve Article
Check if an array is sorted and rotated
  • Difficulty Level : Easy
  • Last Updated : 26 Sep, 2020

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: 
 

C++




// CPP program to check if an array is
// sorted and rotated clockwise
#include <climits>
#include <iostream>
 
using namespace std;
 
// Function to check if an array is
// sorted and rotated clockwise
void checkIfSortRotated(int arr[], int n)
{
    int minEle = INT_MAX;
    int maxEle = INT_MIN;
 
    int minIndex = -1;
 
    // Find the minimum element
    // and it's index
    for (int i = 0; i < n; i++) {
        if (arr[i] < minEle) {
            minEle = arr[i];
            minIndex = i;
        }
    }
 
    int flag1 = 1;
 
    // Check if all elements before minIndex
    // are in increasing order
    for (int i = 1; i < minIndex; i++) {
        if (arr[i] < arr[i - 1]) {
            flag1 = 0;
            break;
        }
    }
 
    int flag2 = 1;
 
    // Check if all elements after minIndex
    // are in increasing order
    for (int i = minIndex + 1; i < n; i++) {
        if (arr[i] < arr[i - 1]) {
            flag2 = 0;
            break;
        }
    }
 
    // Check if last element of the array
    // is smaller than the element just
    // starting element of the array
    // for arrays like [3,4,6,1,2,5] - not circular array
    if (flag1 && flag2 && (arr[n - 1] < arr[0]))
        cout << "YES";
    else
        cout << "NO";
}
 
// Driver code
int main()
{
    int arr[] = { 3, 4, 5, 1, 2 };
    int n = sizeof(arr) / sizeof(arr[0]);
 
    // Function Call
    checkIfSortRotated(arr, n);
    return 0;
}
Java



// Java program to check if an
// array is sorted and rotated
// clockwise
import java.io.*;
 
class GFG {
 
    // Function to check if an array is
    // sorted and rotated clockwise
    static void checkIfSortRotated(int arr[], int n)
    {
        int minEle = Integer.MAX_VALUE;
        int maxEle = Integer.MIN_VALUE;
 
        int minIndex = -1;
 
        // Find the minimum element
        // and it's index
        for (int i = 0; i < n; i++) {
            if (arr[i] < minEle) {
                minEle = arr[i];
                minIndex = i;
            }
        }
 
        boolean flag1 = true;
 
        // Check if all elements before
        // minIndex are in increasing order
        for (int i = 1; i < minIndex; i++) {
            if (arr[i] < arr[i - 1]) {
                flag1 = false;
                break;
            }
        }
 
        boolean flag2 = true;
 
        // Check if all elements after
        // minIndex are in increasing order
        for (int i = minIndex + 1; i < n; i++) {
            if (arr[i] < arr[i - 1]) {
                flag2 = false;
                break;
            }
        }
 
        // check if the minIndex is 0, i.e the first element
        // is the smallest , which is the case when array is
        // sorted but not rotated.
        if (minIndex == 0) {
            System.out.print("NO");
            return;
        }
        // Check if last element of the array
        // is smaller than the element just
        // before the element at minIndex
        // starting element of the array
        // for arrays like [3,4,6,1,2,5] - not sorted
        // circular array
        if (flag1 && flag2 && (arr[n - 1] < arr[0]))
            System.out.println("YES");
        else
            System.out.print("NO");
    }
 
    // Driver code
    public static void main(String[] args)
    {
        int arr[] = { 3, 4, 5, 1, 2 };
 
        int n = arr.length;
 
        // Function Call
        checkIfSortRotated(arr, n);
    }
}
 
// This code is contributed
// by inder_verma.
Python3



# Python3 program to check if an
# array is sorted and rotated clockwise
import sys
 
# Function to check if an array is
# sorted and rotated clockwise
 
 
def checkIfSortRotated(arr, n):
    minEle = sys.maxsize
    maxEle = -sys.maxsize - 1
    minIndex = -1
 
    # Find the minimum element
    # and it's index
    for i in range(n):
        if arr[i] < minEle:
            minEle = arr[i]
            minIndex = i
    flag1 = 1
 
    # Check if all elements before
    # minIndex are in increasing order
    for i in range(1, minIndex):
        if arr[i] < arr[i - 1]:
            flag1 = 0
            break
    flag2 = 2
 
    # Check if all elements after
    # minIndex are in increasing order
    for i in range(minIndex + 1, n):
        if arr[i] < arr[i - 1]:
            flag2 = 0
            break
 
    # Check if last element of the array
    # is smaller than the element just
    # before the element at minIndex
    # starting element of the array
    # for arrays like [3,4,6,1,2,5] - not sorted circular array
    if (flag1 and flag2 and
            arr[n - 1] < arr[0]):
        print("YES")
    else:
        print("NO")
 
 
# Driver code
arr = [3, 4, 5, 1, 2]
n = len(arr)
 
# Function Call
checkIfSortRotated(arr, n)
 
# This code is contributed
# by Shrikant13
C#



// C# program to check if an
// array is sorted and rotated
// clockwise
using System;
 
class GFG {
 
    // Function to check if an array is
    // sorted and rotated clockwise
    static void checkIfSortRotated(int[] arr, int n)
    {
        int minEle = int.MaxValue;
        // int maxEle = int.MinValue;
 
        int minIndex = -1;
 
        // Find the minimum element
        // and it's index
        for (int i = 0; i < n; i++) {
            if (arr[i] < minEle) {
                minEle = arr[i];
                minIndex = i;
            }
        }
 
        bool flag1 = true;
 
        // Check if all elements before
        // minIndex are in increasing order
        for (int i = 1; i < minIndex; i++) {
            if (arr[i] < arr[i - 1]) {
                flag1 = false;
                break;
            }
        }
 
        bool flag2 = true;
 
        // Check if all elements after
        // minIndex are in increasing order
        for (int i = minIndex + 1; i < n; i++) {
            if (arr[i] < arr[i - 1]) {
                flag2 = false;
                break;
            }
        }
 
        // Check if last element of the array
        // is smaller than the element just
        // before the element at minIndex
        // starting element of the array
        // for arrays like [3,4,6,1,2,5] - not circular
        // array
        if (flag1 && flag2 && (arr[n - 1] < arr[0]))
            Console.WriteLine("YES");
        else
            Console.WriteLine("NO");
    }
 
    // Driver code
    public static void Main()
    {
        int[] arr = { 3, 4, 5, 1, 2 };
 
        int n = arr.Length;
         
          // Function Call
        checkIfSortRotated(arr, n);
    }
}
 
// This code is contributed
// by inder_verma.
PHP



<?php
// PHP program to check if an
// array is sorted and rotated
// clockwise
 
// Function to check if an array
// is sorted and rotated clockwise
function checkIfSortRotated($arr, $n)
{
    $minEle = PHP_INT_MAX;
    $maxEle = PHP_INT_MIN;
 
    $minIndex = -1;
 
    // Find the minimum element
    // and it's index
    for ($i = 0; $i <$n; $i++)
    {
        if ($arr[$i] < $minEle)
        {
            $minEle = $arr[$i];
            $minIndex = $i;
        }
    }
 
    $flag1 = 1;
 
    // Check if all elements before
    // minIndex are in increasing order
    for ( $i = 1; $i <$minIndex; $i++)
    {
        if ($arr[$i] < $arr[$i - 1])
        {
            $flag1 = 0;
            break;
        }
    }
 
    $flag2 = 1;
 
    // Check if all elements after
    // minIndex are in increasing order
    for ($i = $minIndex + 1; $i <$n; $i++)
    {
        if ($arr[$i] < $arr[$i - 1])
        {
            $flag2 = 0;
            break;
        }
    }
 
    // Check if last element of the array
    // is smaller than the element just
    // starting element of the array
    // for arrays like [3,4,6,1,2,5] - not sorted circular array
    if ($flag1 && $flag2 &&
       ($arr[$n - 1] < $arr[$0]))
        echo( "YES");
    else
        echo( "NO");
}
 
// Driver code
$arr = array(3, 4, 5, 1, 2);
 
//Function Call
$n = count($arr);
 
checkIfSortRotated($arr, $n);
 
// This code is contributed
// by inder_verma.
?>
Output
YES
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.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.
In case you wish to attend live classes with industry experts, please refer Geeks Classes Live 



My Personal Notes
arrow_drop_up
Previous
Program to check if an array is sorted or not (Iterative and Recursive)
Next

Check if an array is sorted and rotated using Binary Search
Recommended Articles
Page :
Check if an array is sorted and rotated using Binary Search
05, Mar 20
Search an element in a sorted and rotated array
15, Aug 09
Find the minimum element in a sorted and rotated array
02, Jul 13
Given a sorted and rotated array, find if there is a pair with a given sum
30, Mar 15
Maximum element in a sorted and rotated array
28, Mar 19
Search an element in a sorted and rotated array with duplicates
27, Jan 20
Find the Rotation Count in Rotated Sorted array
01, Mar 17
Count elements less than or equal to a given value in a sorted rotated array
15, Jun 17
Sort a Rotated Sorted Array
11, Oct 17
Count rotations in sorted and rotated linked list
26, Sep 17
Check if two sorted arrays can be merged to form a sorted array with no adjacent pair from the same array
16, Nov 20
Print array after it is right rotated K times
27, Apr 20
Count number of common elements between a sorted array and a reverse sorted array
12, May 21
Count number of rotated strings which have more number of vowels in the first half than second half
23, Oct 19
Lexicographically smallest rotated sequence | Set 2
01, Jul 17
Sort a nearly sorted (or K sorted) array
08, Sep 12
Maximum number of partitions that can be sorted individually to make sorted
28, Feb 18
Generate all possible sorted arrays from alternate elements of two given sorted arrays
01, Jul 15
Check if an Array can be Sorted by picking only the corner Array elements
12, Aug 20
Check if array can be sorted by swapping pairs having GCD equal to the smallest element in the array
16, Sep 20
Check whether a given array is a k sorted array or not
21, Jun 17
Check if an array can be sorted by swapping pairs from indices consisting of unequal elements in another array
03, Feb 21
Check if array can be sorted by swapping pairs with GCD of set bits count equal to that of the smallest array element
17, Sep 20
Check if an array can be sorted by rearranging odd and even-indexed elements or not
06, Apr 21
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
barykrg
@barykrg
Vote for difficulty
Current difficulty :
Easy





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox