Question

Hello guys, welcome to this post with another array based coding problem. In the last article, we've learned about finding missing numbers in the array with duplicates and today we'll solve the problem of rotating an array by left or right by given number. For example, suppose an integer array {1, 2, 3} is given and it was asked to rate this array to the left by 3 then the result array will look like {2, 3, 1} because it was rotated twice on left. Similarly if asked to rotate the same array twice by right then we'll get {1, 2, 3}, the same array is back. This is an interesting problem and it's quite easy to solve but I have many programmers struggles with this one as well. So, a little bit of practice and learning will not hurt.

İn program c++ ve Fortran

Answer 1

#include <iostream>

using namespace std;
void rr(int a[],int n)
{
int temp=a[0];
for(int i=0;i<n-1;i++)
{
a[i]=a[i+1];
}
a[n-1]=temp;
}
void rl(int a[],int n)
{
int temp=a[0];
a[0]=a[n-1];
for(int i=n-1;i>=2;i--)
{
a[i]=a[i-1];
}
a[1]=temp;
}
void rotateRight(int a[],int n,int num)
{
for(int i=0;i<num;i++)
{
rr(a,n);
}
}
void rotateLeft(int a[],int n,int num)
{

for(int i=0;i<num;i++)
{
rl(a,n);
}
}
int main () {
int arr[]={1,2,3};
cout<<"Array rotated twice left: ";
rotateLeft(arr,3,2);
for(int i=0;i<3;i++)
{
cout<<arr[i]<<" ";
}
cout<<endl;

cout<<"Array rotated twice right: ";
rotateRight(arr,3,2);
for(int i=0;i<3;i++)
{
cout<<arr[i]<<" ";
}
cout<<endl;

return 0;
}