Given a permutation arrays A[] consisting of N numbers in range [1, N], the task is to left rotate all the even numbers and right rotate all the odd numbers of the permutation and print the updated permutation.
Note: N is always even.
Examples:
Input: A = {1, 2, 3, 4, 5, 6, 7, 8}
Output: {7, 4, 1, 6, 3, 8, 5, 2}
Explanation:
Even element = {2, 4, 6, 8}
Odd element = {1, 3, 5, 7}
Left rotate of even number = {4, 6, 8, 2}
Right rotate of odd number = {7, 1, 3, 5}
Combining Both odd and even number alternatively.
Input: A = {1, 2, 3, 4, 5, 6}
Output: {5, 4, 1, 6, 3, 2}
Approach:
Below is the implementation of the above approach:
// C++ program to implement // the above approach #include<bits/stdc++.h> using namespace std; // function to left rotate void left_rotate(int arr[]) { int last = arr[1]; for (int i = 3; i < 6; i = i + 2) { arr[i - 2] = arr[i]; } arr[6 - 1] = last; } // function to right rotate void right_rotate(int arr[]) { int start = arr[6 - 2]; for (int i = 6- 4; i >= 0; i = i - 2) { arr[i + 2] = arr[i]; } arr[0] = start; } // Function to rotate the array void rotate(int arr[]) { left_rotate(arr); right_rotate(arr); for (int i = 0; i < 6; i++) { cout << (arr[i]) << " "; } } // Driver code int main() { int arr[] = { 1, 2, 3, 4, 5, 6 }; rotate(arr); } // This code is contributed by rock_cool
Output:
5 4 1 6 3 2
Australia
UK
UAE
Singapore
Canada
New
Zealand
Malaysia
USA
India
South
Africa
Ireland
Saudi
Arab
Qatar
Kuwait
Hongkong
Copyright 2016-2023 www.programmingshark.com - All Rights Reserved.
Disclaimer : Any type of help and guidance service given by us is just for reference purpose. We never ask any of our clients to submit our solution guide as it is, anywhere.