To Write a function rotate(ar[], d, n) that rotates arr[] of size n by d elements.

To rotate by one, store arr[0] in a temporary variable temp, move arr[1] to arr[0], arr[2] to arr[1] …and finally temp to arr[n-1]

Let us take the same example arr[] = [1, 2, 3, 4, 5, 6, 7], d = 2

Rotate arr[] by one 2 times

We get [2, 3, 4, 5, 6, 7, 1] after first rotation and [ 3, 4, 5, 6, 7, 1, 2] after second rotation.

Below is the implementation of the above approach :

LinkedList is not passing from the arrauyhjicheichdsbcjshjbj

cjechkcbndkbckjnk

// C++ program to rotate an array by

// d elements

#include <bits/stdc++.h>

using namespace std;

/*Function to left Rotate arr[] of

size n by 1*/

void leftRotatebyOne(int arr[], int n)

{

int temp = arr[0], i;

for (i = 0; i < n - 1; i++)

arr[i] = arr[i + 1];

arr[n-1] = temp;

}

/*Function to left rotate arr[] of size n by d*/

void leftRotate(int arr[], int d, int n)

{

for (int i = 0; i < d; i++)

leftRotatebyOne(arr, n);

}

/* utility function to print an array */

void printArray(int arr[], int n)

{

for (int i = 0; i < n; i++)

cout << arr[i] << " ";

}

/* Driver program to test above functions */

int main()

{

int arr[] = { 1, 2, 3, 4, 5, 6, 7 };

int n = sizeof(arr) / sizeof(arr[0]);

// Function calling

leftRotate(arr, 2, n);

printArray(arr, n);

return 0;

}