programs/matrixshift.cpp at master · karlCobb/programs · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
#include <iostream>
using namespace std;
/*
*shifts the columns and rows i spaces in an  NxN matrix
*currently set to a 5x5 matrix
*/

void move_dynamic_matrix(int[][5], int[][5]);
void transfer_matrix(int[][5], int[][5]);

//n is the number of columns and rows in matrix
int n = 5;
int base = 0;
int top = 0;

int main(){
int array[][5] = {{0,1,2,3,4}, {5,6,7,8,9}, {10,11,12,13,14}, {15,16,17,18,19}, {20,21,22,23,24}};
int new_array[][5] = {{0,0,0,0,0}, {0,0,0,0,0}, {0,0,0,0,0}, {0,0,0,0,0}, {0,0,0,0,0}};
int moves = 0;
top = n-1;

cout << "Original Matrix: " << endl;
for(int k = 0; k < n; ++k)
{        for(int m = 0; m < n; ++m)
{cout << array[k][m];
if(m == (n-1))
        cout << "\n";
else if(array[k][m] < 10)
        cout << " |";
else
        cout << "|";
}//end for loop m
}//end for loop k


cout << "How many moves do you want to shift the matrix above ";
cout << "(a negative shifts it to the right a positive shifts it to the left)\n";
cout << ">>";
cin >> moves;


//set how many to move if negative or positive
int n_perimeter = (n-1)*4;
if(moves < 0)
{moves = n_perimeter + moves;}
else
{moves = moves%n_perimeter;}

//stop when top == bottom for odd and even sized matrices
while(top > base)
{
//rotate one position to the right
for(int i = 0; i < moves; ++i){
move_dynamic_matrix(new_array, array);
if(moves > 0)
{
transfer_matrix(new_array, array);
}

}
top--;
base++;
}
int half = n/2;
//if odd number matrix set middle number
if(n%2 != 0)
{new_array[half][half] = array[half][half];}


cout  << "Rotated Matrix: " << endl;

for(int k = 0; k < n; ++k)
{        for(int m = 0; m < n; ++m)
{cout << new_array[k][m];
if(m == (n-1))
        cout << "\n";
else if(new_array[k][m] < 10)
        cout << " |";
else
	cout << "|";
}//end for loop m
}//end for loop k


}//end main()


//rotate one move to the right
void move_dynamic_matrix(int new_array[][5], int array[][5])
{
for(int i = base, j = top; j > base; j--)
	new_array[i][j-1] = array[i][j];
for(int i = top, j = top; i > base; i--)
	new_array[i-1][j] = array[i][j];
for(int i = top, j = base; j < top; j++)
	new_array[i][j+1] = array[i][j];
for(int i = base, j = base; i < top; i++)
	new_array[i+1][j] = array[i][j];
}

//transfers last move to array
void transfer_matrix(int new_array[][5], int array[][5])
{
for(int i = base, j = top; j > base; j--)
        array[i][j] = new_array[i][j];
for(int i = top, j = top; i > base; i--)
        array[i][j] = new_array[i][j];
for(int i = top, j = base; j < top; j++)
        array[i][j] = new_array[i][j];
for(int i = base, j = base; i < top; i++)
        array[i][j] = new_array[i][j];
}