Javascript 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:
JavaScript
<script>
// Javascript 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)
{
let minEle = Number.MAX_VALUE;
// int maxEle = int.MinValue;
let minIndex = -1;
// Find the minimum element
// and it's index
for (let i = 0; i < n; i++) {
if (arr[i] < minEle) {
minEle = arr[i];
minIndex = i;
}
}
let flag1 = true;
// Check if all elements before
// minIndex are in increasing order
for (let i = 1; i < minIndex; i++) {
if (arr[i] < arr[i - 1]) {
flag1 = false;
break;
}
}
let flag2 = true;
// Check if all elements after
// minIndex are in increasing order
for (let 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]))
document.write("YES");
else
document.write("NO");
}
let arr = [ 3, 4, 5, 1, 2 ];
let n = arr.length;
// Function Call
checkIfSortRotated(arr, n);
// This code is contributed by mukesh07.
</script>
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!
Similar Reads
Javascript Program for Search an element in a sorted and rotated array An element in a sorted array can be found in O(log n) time via binary search. But suppose we rotate an ascending order sorted array at some pivot unknown to you beforehand. So for instance, 1 2 3 4 5 might become 3 4 5 1 2. Devise a way to find an element in the rotated array in O(log n) time. Exam
7 min read
Check if an array is sorted and rotated Given an array arr[] of size n, the task is to return true if it was originally sorted in non-decreasing order and then rotated (including zero rotations). Otherwise, return false. The array may contain duplicates.Examples:Input: arr[] = { 3, 4, 5, 1, 2 }Output: YESExplanation: The above array is so
7 min read
Javascript Program to Sort an array in wave form Given an unsorted array of integers, sort the array into a wave like array. An array 'arr[0..n-1]' is sorted in wave form if arr[0] >= arr[1] <= arr[2] >= arr[3] <= arr[4] >= .....Examples: Input: arr[] = {10, 5, 6, 3, 2, 20, 100, 80} Output: arr[] = {10, 5, 6, 2, 20, 3, 100, 80} OR {
4 min read
Javascript Program to Check if it is possible to sort the array after rotating it Given an array of size N, the task is to determine whether its possible to sort the array or not by just one shuffle. In one shuffle, we can shift some contiguous elements from the end of the array and place it in the front of the array.For eg: A = {2, 3, 1, 2}, we can shift {1, 2} from the end of t
3 min read
Javascript Program For Sorting An Array Of 0s, 1s and 2s Given an array A[] consisting 0s, 1s and 2s. The task is to write a function that sorts the given array. The functions should put all 0s first, then all 1s and all 2s in last.Examples:Input: {0, 1, 2, 0, 1, 2}Output: {0, 0, 1, 1, 2, 2}Input: {0, 1, 1, 0, 1, 2, 1, 2, 0, 0, 0, 1}Output: {0, 0, 0, 0, 0
5 min read