-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathspiralMat.cpp
More file actions
84 lines (67 loc) · 1.22 KB
/
spiralMat.cpp
File metadata and controls
84 lines (67 loc) · 1.22 KB
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
#include <iostream>
int main()
{
int order = 0, count = 0, i, j = 0;
bool right, bottom, left, top = false;
std::cout << "Enter the order of the matrix" << std::endl;
std::cin >> order;
int spiral[order][order];
for(i = 0; i < order; i++)
{
for(j = 0; j < order; j++)
{
spiral[i][j] = 0;
}
}
for(i = 0, j = -1, right = true; count != order * order;)
{
if(right)
{
if(j == order - 1 || spiral[i][j + 1] != 0)
{
right = left = top = false;
bottom = true;
continue;
}
spiral[i][++j] = ++count;
}
if(bottom)
{
if(i == order - 1 || spiral[i + 1][j] != 0)
{
right = top = bottom = false;
left = true;
continue;
}
spiral[++i][j] = ++count;
}
if(left)
{
if(j == 0 || spiral[i][j - 1] != 0)
{
right = left = bottom = false;
top = true;
continue;
}
spiral[i][--j] = ++count;
}
if(top)
{
if(i == 0 || spiral[i - 1][j] != 0)
{
right = true;
left = bottom = top = false;
continue;
}
spiral[--i][j] = ++count;
}
}
for(i = 0; i < order; i++)
{
for(j = 0; j < order; j++)
{
std::cout << spiral[i][j] << " ";
}
std::cout << "\n";
}
}