Javascript Program for Reversal algorithm for right rotation of an array Last Updated : 23 Sep, 2024 Summarize Comments Improve Suggest changes Share Like Article Like Report Given an array, right rotate it by k elements. After K=3 rotation Examples: Input: arr[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10} k = 3Output: 8 9 10 1 2 3 4 5 6 7Input: arr[] = {121, 232, 33, 43 ,5} k = 2Output: 43 5 121 232 33Note : In the below solution, k is assumed to be smaller than or equal to n. We can easily modify the solutions to handle larger k values by doing k = k % n.Algorithm: rotate(arr[], d, n) reverseArray(arr[], 0, n-1) ; reverse(arr[], 0, d-1); reverse(arr[], d, n-1);Below is the implementation of above approach: JavaScript // JavaScript program for right rotation of // an array (Reversal Algorithm) /*Function to reverse arr[] from index start to end*/ function reverseArray(arr, start, end) { while (start < end) { let temp = arr[start]; arr[start] = arr[end]; arr[end] = temp; start++; end--; } return arr; } /* Function to right rotate arr[] of size n by d */ function rightRotate(arr, d, n) { arr = reverseArray(arr, 0, n - 1); arr = reverseArray(arr, 0, d - 1); arr = reverseArray(arr, d, n - 1); return arr; } // driver code let arr = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]; let n = arr.length; let k = 3; arr = rightRotate(arr, k, n); console.log(arr.join(" ")); Output8 9 10 1 2 3 4 5 6 7 Complexity Analysis:Time Complexity: O(N)Auxiliary Space: O(1)Please refer complete article on Reversal algorithm for right rotation of an array for more details! Comment More infoAdvertise with us Next Article Javascript Program for Reversal algorithm for right rotation of an array K kartik Follow Improve Article Tags : JavaScript rotation Similar Reads Javascript Program for Reversal algorithm for array rotation Write a function rotate(arr[], d, n) that rotates arr[] of size n by d elements. Example : Input : arr[] = [1, 2, 3, 4, 5, 6, 7] d = 2 Output : arr[] = [3, 4, 5, 6, 7, 1, 2] Rotation of the above array by 2 will make array Recommended: Please solve it on “PRACTICE †first, before moving on to the so 3 min read Reversal algorithm for right rotation of an array Given an array, right rotate it by k elements. After K=3 rotation Examples: Input: arr[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10} k = 3 Output: 8 9 10 1 2 3 4 5 6 7 Input: arr[] = {121, 232, 33, 43 ,5} k = 2 Output: 43 5 121 232 33 Note : In the below solution, k is assumed to be smaller than or equal to n 6 min read Javascript Program for Block swap algorithm for array rotation Write a function rotate(ar[], d, n) that rotates arr[] of size n by d elements. Rotation of the above array by 2 will make array Algorithm : Initialize A = arr[0..d-1] and B = arr[d..n-1] 1) Do following until size of A is equal to size of B a) If A is shorter, divide B into Bl and Br such that Br i 3 min read Javascript Program to Find Mth element after K Right Rotations of an Array Given non-negative integers K, M, and an array arr[ ] consisting of N elements, the task is to find the Mth element of the array after K right rotations. Examples: Input: arr[] = {3, 4, 5, 23}, K = 2, M = 1 Output: 5 Explanation: The array after first right rotation a1[ ] = {23, 3, 4, 5} The array a 8 min read Reversal algorithm for Array rotation Given an array arr[] of size N, the task is to rotate the array by d position to the left. Examples: Input: arr[] = {1, 2, 3, 4, 5, 6, 7}, d = 2Output: 3, 4, 5, 6, 7, 1, 2Explanation: If the array is rotated by 1 position to the left, it becomes {2, 3, 4, 5, 6, 7, 1}.When it is rotated further by 1 15 min read Like