Question: Find the transpose of a square matrix using recursion

Solution: void Transpose(int** A, int N) // Square size - 1
{
if(N == 0) // Transpose of a 1 X 1 Matrix
return;
else
{
Transpose(A,N-1);
for(int i=0; i {
int temp = A[i][N] ;
A[i][N] = A[N][i];
A[N][i] = temp;
}
}
}