C++ Program to Print all possible rotations of a given Array

// C++ program to print
// all possible rotations
// of the given array
#include <iostream>
using namespace std;   

// Global declaration of array
int arr[10000];

// Function to reverse array 
// between indices s and e
void reverse(int arr[], 
             int s, int e)
{
  while(s < e)
  {
    int tem = arr[s];
    arr[s] = arr[e];
    arr[e] = tem;
    s = s + 1;
    e = e - 1;
  }
}

// Function to generate all
// possible rotations of array
void fun(int arr[], int k)
{
  int n = 4 - 1;
  int v = n - k;

  if (v >= 0)
  {
    reverse(arr, 0, v);
    reverse(arr, v + 1, n);
    reverse(arr, 0, n);
  }
}

// Driver code
int main()
{
  arr[0] = 1;
  arr[1] = 2;
  arr[2] = 3;
  arr[3] = 4;

  for(int i = 0; i < 4; i++)
  {
    fun(arr, i);
    cout << ("[");
    
    for(int j = 0; j < 4; j++)
    {
      cout << (arr[j]) << ", ";
    }
    cout << ("]");
  }
}

// This code is contributed by Princi Singh 

#include <iostream>
using namespace std;
// Nikunj Sonigara
int main()
{
    int arr[] = {1, 2, 3, 4};
    int n = sizeof(arr) / sizeof(arr[0]);

    int rotatedArr[2*n];

    // Copy the array twice into the rotatedArr
    for (int i = 0; i < n; i++) {
        rotatedArr[i] = arr[i];
        rotatedArr[i+n] = arr[i];
    }

    // Generate all possible rotations
    for (int i = 0; i < n; i++) {
        cout << "[";
        for (int j = i; j < i+n; j++) {
            cout << rotatedArr[j];
            if(j != i+n-1)
                cout << " ";
        }
        cout << "] ";
    }

    return 0;
}