#include #define R 4 #define C 4 /* The idea is to use loops similar to the program for printing a spiral matrix. One by one, we rotate all the rings of the elements, starting from the outermost. To rotate a ring, we have to do the following. 1) Move the elements on the first line 2) Move the elements of the last column 3) We move the next line items 4) Move the elements of the first column We repeat these steps until we have no move */ using namespace std; /* The function for rotate a matrix, where m=R, n=C*/ void rotateMatrix(int m, int n, int a[R][C]) { int rand=0, coloana=0, urmator, curent, i, j; /* rand-> the beginning of the index of a row m-> end of row index coloana-> the beginning of a column index n-> end of column index i-> iterator */ while(rand=coloana;--i) { curent=a[m-1][i]; a[m-1][i]=urmator; urmator=curent; } } m--; // We move the items on the first column to the remaining rows if(coloana=rand;--i) { curent=a[i][coloana]; a[i][coloana]=urmator; urmator=curent; } } coloana++; } // We showed the rotated matrix for(i=0;i>a[i][j]; cout<<"\n"; rotateMatrix(R,C,a); return 0; }

Rotate a given matrix