I need help with finding the complexity of this code:

Find the complexity for the following code that transposes n x n matrices:

for (i = 0; i < n; i++)

for (j = i + 1; j < n; j++) {

tmp = a[i][j];

a[i][j] = a[j][i];

a[j][i] = tmp;

}