-
Notifications
You must be signed in to change notification settings - Fork 78
Expand file tree
/
Copy pathChakravyuh the spiral pattern programming in C
More file actions
88 lines (74 loc) · 1.03 KB
/
Chakravyuh the spiral pattern programming in C
File metadata and controls
88 lines (74 loc) · 1.03 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
85
86
87
88
#include<stdio.h>
main()
{
int i,j,a[100][100],size,row=0,col=0,boundaryStart=0,boundaryEnd,num,evenRowCol=0,evenRow=0,evenCol=0,count=1;
printf("Enter number of rows\n");
scanf("%d",&size);
boundaryEnd=size-1;
for(i=0;i<size;i++)
{
for(j=0;j<size;j++) a[i][j]=0;
}
while(count<=(size*size))
{
if(evenRowCol%2==0)
{
if(evenRow%2==0)
{
for(i=col;(i<=boundaryEnd) && (count<=size*size);i++)
{
a[row][i]=count;
count++;
}
evenRow++;
col=i-1;
row++;
}
else
{
for(i=col;(i>=boundaryStart) && (count<=size*size);i--)
{
a[row][i]=count;
count++;
}
evenRow++;
col=i+1;
row--;
boundaryStart++;
}
evenRowCol++;
}
else
{
if(evenCol%2==0)
{
for(i=row;(i<=boundaryEnd) && (count<=size*size);i++)
{
a[i][col]=count;
count++;
}
row=i-1;
col--;
evenCol++;
}
else
{
for(i=row;(i>=boundaryStart) && (count<=size*size);i--)
{
a[i][col]=count;
count++;
}
row=i+1;
col++;
evenCol++;
boundaryEnd--;
}
evenRowCol++;
}
}
for(i=0;i<size;i++)
{
for(j=0;j<size;j++) printf("%3d ",a[i][j]);
printf("\n");
}
}