Gfg cyclic array rotation

# include <iostream> 
using namespace std; 

void rotate(int arr[], int n) 
{ 
	int last = arr[n - 1], i; 
	for (i = n - 1; i > 0; i--) 
	arr[i] = arr[i - 1]; 
	arr[0] = last; 
} 


int main() 
{ 
	int arr[100], i; 
	int n, turns;

	cin >> n;

	for(i=0;i<n;i++){
		scanf("%d", &arr[i]);
	}
    
	cin >> turns;

	while(turns>=1){
		rotate(arr,n);
		turns--;
	}

	for(i=0;i<n;i++){
		cout << arr[i] << " ";
	}

	return 0; 
}

Similar codes

0 vote120 views1 answer
Std::iomanip c++
C++
0 vote130 views1 answer
Binary algebra cpp
C++
0 vote143 views1 answer
Imports the elements in the array c++
C++
3 votes158 views3 answers
Largest Subarray with Zero Sum
C++
2 votes131 views1 answer
How to find typein c++
C++
3 votes120 views2 answers
C++ vector element search
C++
0 vote127 views1 answer
For auto map C
C++
2 votes123 views1 answer
Binary search return index c++
C++
0 vote142 views1 answer
"++i + ++i" explanation
C++
7 votes118 views6 answers
C++ sleep function
C++