top of page

2 x 2 Matrix Rotation

Writer's picture: Code CrazeCode Craze

Updated: Feb 23, 2023



#include <stdio.h>


void main() {

int m[2][2]={

{2,1},

{3,7}

};

int i,j;

printf("\n----Current Matrix----\n\n");

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

{

for(j=0;j<2;j++)

{

printf(" %d ",m[i][j]);

}

printf("\n");

}

printf("\n----Matrix After 90 Degree Clockwise Rotation----\n\n");

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

{

for(j=1;j>=0;j--)

{

printf(" %d ",m[j][i]);

}

printf("\n");

}

printf("\n----Matrix After 90 Degree Anti-clockwise Rotation----\n\n");

for(i=1;i>=0;i--)

{

for(j=0;j<2;j++)

{

printf(" %d ",m[j][i]);

}

printf("\n");

}


printf("\n----Matrix After 180 Degree Rotation----\n\n");

for(i=1;i>=0;i--)

{

for(j=1;j>=0;j--)

{

printf(" %d ",m[i][j]);

}

printf("\n");

}


}

3 views0 comments

Recent Posts

See All

Stack Using Queue

A stack can be implemented using two queues in C. The basic idea is to use one queue for enqueue operations and another for dequeue...

Comments


bottom of page