FOR FREE CONTENT
Rotated the Array at left
Back to ProgrammingDescription
The elements are taken as input. The array is rotated left (in that case we assume that the program saying about circular array) That means, the element of index 1 is stored in index 0, the element of index 2 is stored in index 1, and so on. And the element of index 0 is stored in index n - 1.
.png)
.png)
Algorithm
INPUT: Array elements
OUTPUT: the array after left rotation
PROCESS:
Step 1: [taking the input]
Read n [number of elements]
For i=0 to n-1 repeat
Read a[i]
[end of ‘for’ loop]
Step 2: [Rotating the array]
Set t<-a[0]
For i=1 to n-1 repeat
Set a[i-1]<-a[i]
[End of ‘for’ loop]
Set a[n-1]<-t
Print “The array after rotation is: “
For i=0 to n-1 repeat
Print a[i]
[End of ‘for’ loop]
Step 3: Stop.
Code
Complexity:
.png)
.png)
.png)
Related
- Find Maximum and Minimum from an array
- Kth Largest and Smallest Element
- 2nd largest element from the array
- Find how many negative numbers are present in the array
- The elements of the one array are copied to another array.
- Delete element from any position in array
- Frequency of each element in the Array
- Find out the unique elements from the Array
- Finds odd and even elements from the array and stored in two separate arrays
- Counts the number of odd and even elements separately from the array
- Reverses the elements of an Array
- Merge two Array and stored in the third Array
- Rotated the Array right
- Sorted the array and then separate even and odd elements in different array
- Sort number of strings in an array
- Check one given element of an array present more than n/2 times or not.
- Sum of the elements of an Array is calculated using a pointer
- The union and intersection between the two given arrays
