array rotation program in java
//Rotating array left
//d = number of rotations
static void rotLeft(int[] a, int d)
{
//using secondary array of same size
int [] n = new int[a.length];
//saving element into array n[] according to newlocation of rotations(d)
for(int i = 0; i < a.length; i++)
{
int newlocation = (i+(a.length - d))% a.length;
n[newlocation] = a[i];
}
//printing new rotated array
for(int i = 0; i < a.length; i++)
{
System.out.print(n[i]+ " ");
}
}shift array elements to the right
#include<stdio.h>
void main()
{
int i,n,a[100],temp;
printf("Enter the number of elements:n") ;
scanf("%d",&n);
printf("Enter the elementsn");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
printf("Original arrayn");
for(i=0;i<n;i++)
{
printf("%d ",a[i]);
}
/* shifting array elements */
temp=a[n-1];
for(i=n-1;i>0;i--)
{
a[i]=a[i-1];
}
a[0]=temp;
printf("nNew array after rotating by one postion in the right directionn");
for(i=0;i<n;i++)
{
printf("%d ",a[i]);
}
}rorate array
function rotateArray(A, K) {
if (!A.length) return A;
let index = -1;
while (++index < K) {
A.unshift(A.pop());
}
return A;
}
[
rotateArray([3, 8, 9, 7, 6], 3),
rotateArray([0, 0, 0], 1),
rotateArray([1, 2, 3, 4], 4),
rotateArray([], 4),
].join(' | ');Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
