0% found this document useful (0 votes)
32 views13 pages

Array Rotation

The document discusses different approaches to rotate an array to the left by a given number of positions: 1. Using a temporary array to store elements, then copying them back in the rotated order. 2. Iteratively shifting each element left by one position d times. 3. Using a "juggling algorithm" that divides the array into sets based on the greatest common divisor of the array length and positions to rotate.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
32 views13 pages

Array Rotation

The document discusses different approaches to rotate an array to the left by a given number of positions: 1. Using a temporary array to store elements, then copying them back in the rotated order. 2. Iteratively shifting each element left by one position d times. 3. Using a "juggling algorithm" that divides the array into sets based on the greatest common divisor of the array length and positions to rotate.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 13

Program for array rotation

● Difficulty Level : Easy


● Last Updated : 02 Jan, 2023

Read

Discuss(830+)

Courses @Sale

Practice

Video

Given an array of integers arr[] of size N and an integer, the task is to rotate the
array elements to the left by d positions.

Examples:

Input:

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

Output: 3 4 5 6 7 1 2

Input: arr[] = {3, 4, 5, 6, 7, 1, 2}, d=2

Output: 5 6 7 1 2 3 4
Approach 1 (Using temp array): This problem can be solved using the below
idea:

After rotating d positions to the left, the first d elements become the last d
elements of the array

● First store the elements from index d to N-1 into the temp array.
● Then store the first d elements of the original array into the temp array.
● Copy back the elements of the temp array into the original array

Illustration:

Suppose the give array is arr[] = [1, 2, 3, 4, 5, 6, 7], d = 2.

First Step:

=> Store the elements from 2nd index to the last.

=> temp[] = [3, 4, 5, 6, 7]

Second Step:

=> Now store the first 2 elements into the temp[] array.

=> temp[] = [3, 4, 5, 6, 7, 1, 2]


Third Steps:

=> Copy the elements of the temp[] array into the original array.

=> arr[] = temp[] So arr[] = [3, 4, 5, 6, 7, 1, 2]

Follow the steps below to solve the given problem.

● Initialize a temporary array(temp[n]) of length same as the original


array
● Initialize an integer(k) to keep a track of the current index
● Store the elements from the position d to n-1 in the temporary array
● Now, store 0 to d-1 elements of the original array in the temporary array
● Lastly, copy back the temporary array to the original array

Below is the implementation of the above approach :


def rotate(L, d, n):
k = L.index(d)
new_lis = []
new_lis =
L[k+1:]+L[0:k+1]
return new_lis

if __name__ == '__main__':
arr = [1, 2, 3, 4, 5,
6, 7]
d = 2
N = len(arr)

# Function call
arr = rotate(arr, d, N)
for i in arr:
print(i, end=" ")

Output

3 4 5 6 7 1 2

Time complexity: O(N)

Auxiliary Space: O(N)

Approach 2 (Rotate one by one): This problem can be solved using the below
idea:

● At each iteration, shift the elements by one position to the left circularly
(i.e., first element becomes the last).
● Perform this operation d times to rotate the elements to the left by d
position.

Illustration:
Let us take arr[] = [1, 2, 3, 4, 5, 6, 7], d = 2.

First Step:

=> Rotate to left by one position.

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

Second Step:

=> Rotate again to left by one position

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

Rotation is done by 2 times.

So the array becomes arr[] = {3, 4, 5, 6, 7, 1, 2}

Follow the steps below to solve the given problem.

● Rotate the array to left by one position. For that do the following:
○ Store the first element of the array in a temporary variable.
○ Shift the rest of the elements in the original array by one
place.
○ Update the last index of the array with the temporary variable.
● Repeat the above steps for the number of left rotations required.
Below is the implementation of the above approach:

# Python program to rotate an array by d


elements

# Function to left rotate arr[] of size n by


d
def Rotate(arr, d, n):
p = 1
while(p <= d):
last = arr[0]
for i in range (n - 1):
arr[i] = arr[i + 1]
arr[n - 1] = last
p = p + 1

# Function to print an array


def printArray(arr, size):
for i in range (size):
print(arr[i] ,end = " ")

# Driver code
arr = [1, 2, 3, 4, 5, 6, 7]
N = len(arr)
d = 2

# Function calling
Rotate(arr, d, N)
printArray(arr, N)

# This code is contributed by


Atul_kumar_Shrivastava

Output

3 4 5 6 7 1 2

Time Complexity: O(N * d)


Auxiliary Space: O(1)

Approach 3 (A Juggling Algorithm): This is an extension of method 2.

Instead of moving one by one, divide the array into different sets where the
number of sets is equal to the GCD of N and d (say X. So the elements which are
X distance apart are part of a set) and rotate the elements within sets by 1
position to the left.

● Calculate the GCD between the length and the distance to be moved.
● The elements are only shifted within the sets.
● We start with temp = arr[0] and keep moving arr[I+d] to arr[I] and finally
store temp at the right place.

Follow the below illustration for a better understanding

Illustration:

Each steps looks like following:


Let arr[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14} and d = 10

First step:

=> First set is {0, 5, 10}.

=> Rotate this set by d position in cyclic order

=> arr[0] = arr[0+10]

=> arr[10] = arr[(10+10)%15]

=> arr[5] = arr[0]

=> This set becomes {10,0,5}

=> Array arr[] = {10, 1, 2, 3, 4, 0, 6, 7, 8, 9, 5, 11, 12, 13, 14}


Second step:

=> Second set is {1, 6, 11}.

=> Rotate this set by d position in cyclic order.

=> This set becomes {11, 1, 6}

=> Array arr[] = {10, 11, 2, 3, 4, 0, 1, 7, 8, 9, 5, 6, 12, 13, 14}

Third step:

=> Second set is {2, 7, 12}.

=> Rotate this set by d position in cyclic order.

=> This set becomes {12, 2, 7}

=> Array arr[] = {10, 11, 12, 3, 4, 0, 1, 2, 8, 9, 5, 6, 7, 13, 14}

Fourth step:

=> Second set is {3, 8, 13}.

=> Rotate this set by d position in cyclic order.


=> This set becomes {13, 3, 8}

=> Array arr[] = {10, 11, 12, 13, 4, 0, 1, 2, 3, 9, 5, 6, 7, 8, 14}

Fifth step:

=> Second set is {4, 9, 14}.

=> Rotate this set by d position in cyclic order.

=> This set becomes {14, 4, 9}

=> Array arr[] = {10, 11, 12, 13, 14, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9}

Follow the steps below to solve the given problem.

● Perform d%n in order to keep the value of d within the range of the
array where d is the number of times the array is rotated and N is the
size of the array.
● Calculate the GCD(N, d) to divide the array into sets.
● Run a for loop from 0 to the value obtained from GCD.
○ Store the value of arr[i] in a temporary variable (the value of i
denotes the set number).
○ Run a while loop to update the values according to the set.
● After exiting the while loop assign the value of arr[j] as the value of the
temporary variable (the value of j denotes the last element of the ith
set).
Below is the implementation of the above approach :
# Python3 program to rotate an array by
# d elements
# Function to left rotate arr[] of size
n by d

def leftRotate(arr, d, n):


d = d % n
g_c_d = gcd(d, n)
for i in range(g_c_d):

# move i-th values of blocks


temp = arr[i]
j = i
while 1:
k = j + d
if k >= n:
k = k - n
if k == i:
break
arr[j] = arr[k]
j = k
arr[j] = temp

# UTILITY FUNCTIONS
# function to print an array

def printArray(arr, size):


for i in range(size):
print("% d" % arr[i], end=" ")

# Function to get gcd of a and b

def gcd(a, b):


if b == 0:
return a
else:
return gcd(b, a % b)

# Driver program to test above


functions
arr = [1, 2, 3, 4, 5, 6, 7]
n = len(arr)
d = 2
leftRotate(arr, d, n)
printArray(arr, n)

# This code is contributed by


Shreyanshi Arun

Output

3 4 5 6 7 1 2

Time complexity : O(N)

Auxiliary Space : O(1)

Please see the following posts for other methods of array rotation:

Block swap algorithm for array rotation

Reversal algorithm for array rotation

Please write comments if you find any bugs in the above programs/algorithms.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy