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 vote134 views1 answer
Give an algorithm for finding the ith-to-last node in a singly linked list in which the last node is indicated by a null next reference.
C++
2 votes144 views2 answers
Char
C++
4 votes136 views3 answers
C++ how to get maximum value
C++
1 vote144 views4 answers
C++ pause
C++
3 votes143 views2 answers
Search in vector of pairs c++
C++
0 vote142 views1 answer
C++ insertion in astack
C++
6 votes149 views2 answers
Strcmp
C++
9 votes130 views4 answers
Print vector of vector c++
C++
0 vote125 views1 answer
How to execute a command and get return code stdout and stderr of command in C++
C++
92 votes278 views6 answers
String reverse
C++