Скачать или смотреть Array Rotation | Juggling Algorithm

Different Approaches to Perform an Array Rotation

Approach 4 - Juggling algorithm for rotate the array to the left or right by 'r' steps, where 'r' is non-negative.

Problem:
We have an array consisting of Integers ∈ Z of size (n) and a positive integer of rotation count (r) ∈ Z+.
We are allowed to shift each of the array's elements by one position.
We have to perform left or right rotations in an array.

Algorithm Concept:
Left Rotation
Divide the array into M Sets, where M =(is the) GCD (n,r), where ‘n’ is the array size and ‘r’ is the number of rotations and then shift each element of Sets towards left by one position until all elements are shifted.

Right Rotation
Divide the array into M Sets, where M =(is the) GCD (n,r), where ‘n’ is the array size and ‘r’ is the number of rotations and then shift each element of Sets towards right by one position until all elements are shifted.

Outline (check the comment section for a clickable version):
00:00 : Introduction
00:10 : Left Rotation | Algorithm Steps
01:41 : Time and Auxiliary Space Complexity Analysis
04:21 : Right Rotation | Algorithm Steps
04:41 : Animation Example 1
07:23 : Animation Example 2
11:53 : Code Implementation of Algorithm

Code Available At:
https://sites.google.com/view/arrayro...

Other Approaches:
Approach 1 - Using Brute Force -    • Array Rotation  
Approach 2 - Using Temporary Variable -    • Array Rotation | Temporary Variable  
Approach 3 - Using Auxiliary Array -    • Array Rotation | Auxiliary Array  
Approach 5 - Using Reversal Algorithm -    • Array Rotation | Reversal Algorithm  
Approach 6 - Using Block Swap Algorithm -    • Array Rotation | Block Swap Algorithm