Just Swap in correct Way


#1
 int n = a.size();

 int b = 0 , e = n-1;

 for(int  i = 0 ; i < n / 2; i++)
 {
       for(int  j = b ; j< e ; j++)
       {
               swap(a[i][j] , a[n-1-j][i]);
               swap(a[n-1-j][i] , a[n-1-i][n-1-j]);
               swap(a[n-1-i][n-1-j] , a[j][n-1-i]);
       }

       b++;e--;
 }