Program to Find Transpose of 2D Matrix.

//C++ Code to Transpose a Matrix
#include<bits/stdc++.h>
using namespace std;

//function to transpose matrix
void transpose(int arr[][3]){

    for(int i = 0; i < 3; i++){
        for(int j = i+1; j < 3; j++){
            swap(arr[i][j], arr[j][i]);
        }
    }
}

int main(){
    int arr[3][3] = {{2, 3, 6},
                     {1, 4, 1},
                     {9, 2, 5}};

    transpose(arr);

    cout<<"Transpose of given Matrix: "<<endl;
    for(int i = 0; i < 3; i++){
        for(int j = 0; j < 3; j++){
            cout<<arr[i][j]<<" ";
        }
        cout<<endl;
    }    
    return 0;             
}

Transpose of given Matrix: 
2 1 9
3 4 2
6 1 5

• Time Complexity: O(MxN) where M is the number of rows and N is the number of columns.
• Space Complexity: O(1), no extra space is required to solve this problem.