Matrix rotation, C++ (gcc)

Language: Layout:

//Title of this code

#include <iostream>

using namespace std;

const int n = 4;
const int m = 4;

/*
Rotate by +90:
    Transpose
    Reverse each row

Rotate by -90:
    Transpose
    Reverse each column

Rotate by +180:
    Method 1: Rotate by +90 twice
    Method 2: Reverse each row and then reverse each column

Rotate by -180:
    Method 1: Rotate by -90 twice
    Method 2: Reverse each column and then reverse each row
    Method 3: Reverse by +180 as they are same
*/

void rotateMatrix(int t[n][m]) {
    int dest[n][m];
    
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < m; ++j)
            dest[j][n - i - 1] = t[i][j];
    
    // copy the matrix
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < m; ++j)
            t[i][j] = dest[i][j];
}

void printMatrix(int t[n][m]) {
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            cout << t[i][j] << " ";
        }
        cout << endl;
    } 
}

int main()
{
    int dest[n][m];
    int t[n][m] = {
         {5, 1, 2, 6},
         {1, 1, 9, 3},
         {1, 1, 2, 3},
         {8, 1, 2, 7}
        };
    
    printMatrix(t);
    rotateMatrix(t);
    //rotateMatrix(t);
    //rotateMatrix(t);
    //rotateMatrix(t);
    cout << endl;
    printMatrix(t);

}

Show compiler warnings [ + ] Compiler args [ + ] Show input
Compilation time: 0.41 sec, absolute running time: 0.14 sec, cpu time: 0 sec, memory peak: 3 Mb, absolute service time: 0.64 sec