Explanation
In this program, we need to rotate the elements of an array towards the left by the specified number of times. In the left rotation, each element of the array will be shifted to its left by one position and the first element of the array will be added to end of the list. This process will be followed for a specified number of times.
Consider above array, if n is 1 then, all elements of the array will be moved to its left by one position such that second element of the array will take the first position, the third element will be moved to the second position and so on. The first element of the array will be added to the last of the array.
Algorithm
- Declare and initialize an array.
- Variable n will denote the number of times an array should be rotated toward its left.
- The array can be left rotated by shifting its elements to a position prior to them which can be accomplished by looping through the array and perform the operation arr[j] = arr[j+1].
- The first element of the array will be added to the last of rotated array.
Input:
arr = [1, 2, 3, 4, 5]
Here, n determine the number of times an array should be rotated
n = 3
Output:
Original array: 1 2 3 4 5
Array after left rotation: 4 5 1 2 3
Python
Output:
C
Output:
JAVA
Output:
C#
Output:
PHP
Output: