Open in App
Not now

Circularly Sorted Array (Sorted and Rotated Array)

• Difficulty Level : Easy
• Last Updated : 21 Jan, 2023

Circularly sorted arrays are arrays that are sorted in ascending or descending order and then rotated by a number of steps.

Let us take an example to know more about circularly sorted arrays:

Consider an array: arr[] = {23, 34, 45, 12, 17, 19}
The elements here, {12, 17, 19, 23, 34, 45} are sorted ‘In-order’ but they are rotated to the left by 3 times.

Ascending circularly sorted array:

• Consider an array sorted in ascending order: arr[] = {12, 17, 19, 23, 34, 45}
• If the above array is rotated by 3 steps to the left, then the resultant array will be ascending circularly sorted array: {23, 34, 45, 12, 17, 19}

Descending circularly sorted array:

• Consider an array sorted in descending order: arr[] = {35, 26, 11, 9, 5, 3}
• If the above array is rotated by 3 steps to the left, then the resultant array will be descending circularly sorted array: {9, 5, 3, 35, 26, 11}

Let us check through the below problem whether the given array is circularly sorted or not:

Problem Statement:

Given an array arr[] of length N, the task is to check whether the given array is circularly sorted or not, we need to check whether the given array is the rotated form of the sorted array.

• In ascending circularly sorted array, there will be at most one case where the element just before the current element will be greater than the current element i.e., arr[ i – 1 ] > arr[ i ]. So we need to count the total existence of such cases and if the count is greater than 1 then the result will be false else the result will be true meaning that the array is circularly sorted.

Below is the implementation for the above approach:

C++

 `// CPP program to check whether` `// the array is circularly sorted`   `#include ` `using` `namespace` `std;`   `// Function to check whether` `// array is circularly sorted` `bool` `checkCircularSorted(``int` `arr[], ``int` `n)` `{`   `    ``// cnt variable will store count of` `    ``// arr[i-1] > arr[i]` `    ``int` `cnt = 0;`   `    ``for` `(``int` `i = 1; i < n; i++) {`   `        ``// increase cnt if arr[i-1] > arr[i]` `        ``if` `(arr[i - 1] > arr[i]) {` `            ``cnt++;` `        ``}` `    ``}`   `    ``// if cnt > 1 then false` `    ``// else true` `    ``if` `(cnt == 1) {` `        ``return` `true``;` `    ``}` `    ``else` `{` `        ``return` `false``;` `    ``}` `}`   `// Driver code` `int` `main()` `{`   `    ``// Given array` `    ``int` `arr[] = { 23, 34, 45, 12, 17, 19 };`   `    ``// size of array` `    ``int` `N = ``sizeof``(arr) / ``sizeof``(arr[0]);`   `    ``// Calling function to check` `    ``// cirularly sorted array` `    ``bool` `result = checkCircularSorted(arr, N);`   `    ``// Print result` `    ``if` `(result) {` `        ``cout << ``"Array is circularly sorted"``;` `    ``}` `    ``else` `{` `        ``cout << ``"Array is not circularly sorted"``;` `    ``}` `}`

Java

 `// Java program to check whether` `// the array is circularly sorted`   `public` `class` `Main {`   `    ``// Method to check whether` `    ``// array is circularly sorted` `    ``public` `static` `boolean` `checkCircularSorted(``int` `arr[])` `    ``{` `        ``// cnt variable will store` `        ``// count of arr[i-1] > arr[i]` `        ``int` `cnt = ``0``;`   `        ``for` `(``int` `i = ``1``; i < arr.length; i++) {` `            ``// increase cnt if arr[i-1] > arr[i]` `            ``if` `(arr[i - ``1``] > arr[i]) {` `                ``cnt++;` `            ``}` `        ``}` `        ``// if cnt > 1 then false` `        ``// else true` `        ``if` `(cnt == ``1``) {` `            ``return` `true``;` `        ``}` `        ``else` `{` `            ``return` `false``;` `        ``}` `    ``}`   `    ``// Driver code` `    ``public` `static` `void` `main(String args[])` `    ``{` `        ``// Given array` `        ``int` `arr[] = { ``23``, ``34``, ``45``, ``12``, ``17``, ``19` `};`   `        ``// calling method to check` `        ``// cirularly sorted array` `        ``boolean` `result = checkCircularSorted(arr);`   `        ``// print result` `        ``if` `(result == ``true``) {` `            ``System.out.println(` `                ``"Array is circularly sorted"``);` `        ``}` `        ``else` `{` `            ``System.out.println(` `                ``"Array is not circularly sorted"``);` `        ``}` `    ``}` `}`

Python

 `#  Python program to check whether` `#  the array is circularly sorted`   `# Function to check whether` `# array is circularly sorted`     `def` `checkCircularSorted(arr):` `    ``# cnt variable will store count of` `    ``# arr[i-1] > arr[i]` `    ``cnt ``=` `0` `    ``n ``=` `len``(arr)` `    ``for` `i ``in` `range``(``1``, n):`   `        ``# increase cnt if arr[i-1] > arr[i]` `        ``if` `arr[i ``-` `1``] > arr[i]:` `            ``cnt ``+``=` `1`   `    ``# if cnt > 1 then false` `    ``# else true` `    ``if` `cnt ``=``=` `1``:` `        ``return` `True` `    ``else``:` `        ``return` `False`     `# Driver code` `if` `__name__ ``=``=` `'__main__'``:` `    ``# Given array` `    ``arr ``=` `[``23``, ``34``, ``45``, ``12``, ``17``, ``19``]`   `    ``# Calling function to check` `    ``# cirularly sorted array` `    ``result ``=` `checkCircularSorted(arr)`   `    ``# Print result` `    ``if` `result ``=``=` `True``:` `        ``print``(``"Array is circularly sorted"``)` `    ``else``:` `        ``print``(``"Array is not circularly sorted"``)`   `# This code has been contributed by Sachin Sahara (sachin801)`

C#

 `// C# program to check whether` `// the array is circularly sorted` `using` `System;`   `public` `class` `GFG {`   `  ``// Method to check whether` `  ``// array is circularly sorted` `  ``public` `static` `bool` `checkCircularSorted(``int` `[]arr)` `  ``{` `    ``// cnt variable will store` `    ``// count of arr[i-1] > arr[i]` `    ``int` `cnt = 0;`   `    ``for` `(``int` `i = 1; i < arr.Length; i++) {` `      ``// increase cnt if arr[i-1] > arr[i]` `      ``if` `(arr[i - 1] > arr[i]) {` `        ``cnt++;` `      ``}` `    ``}` `    ``// if cnt > 1 then false` `    ``// else true` `    ``if` `(cnt == 1) {` `      ``return` `true``;` `    ``}` `    ``else` `{` `      ``return` `false``;` `    ``}` `  ``}`   `  ``// Driver code` `  ``public` `static` `void` `Main(``string` `[]args)` `  ``{` `    ``// Given array` `    ``int` `[]arr = { 23, 34, 45, 12, 17, 19 };`   `    ``// calling method to check` `    ``// cirularly sorted array` `    ``bool` `result = checkCircularSorted(arr);`   `    ``// print result` `    ``if` `(result == ``true``) {` `      ``Console.WriteLine(``"Array is circularly sorted"``);` `    ``}` `    ``else` `{` `      ``Console.WriteLine(``"Array is not circularly sorted"``);` `    ``}` `  ``}` `}`   `// This code is contributed by AnkThon`

Javascript

 ``

Output

`Array is circularly sorted`

Time Complexity: O(n)

Auxiliary Space: O(1)

Similarly, we can do the above operation for descending circularly sorted array. In this case we need to consider the count of the case where, arr [i-1] < arr[i]

Related articles:

My Personal Notes arrow_drop_up
Related Articles