回形遍历二维数组

int time = 0;
int col = 15;
int row = 10;
int array[15][10];

for (int n=0;;n++)
{
for (int i=n;i<col-n;i++)
{
cout<<"("<<n<<","<<i<<")"<<"  ";
time++;//每执行一次输出操作，time的值增加一
}
cout<<endl;
cout<<endl;
if(time==row*col)break;
for (int j=n+1;j<row-n;j++)
{
cout<<"("<<j<<","<<col-n-1<<")"<<"  ";
time++;
}
cout<<endl;
if(time==row*col)break;
for (int i=col-2-n;i>=n;i--)
{
cout<<"("<<row-n-1<<","<<i<<")"<<"  ";
time++;
}
cout<<endl;
if(time==row*col)break;
for (int j=row-2-n;j>n;j--)
{
cout<<"("<<j<<","<<n<<")"<<"  ";
time++;
}
cout<<endl;
if(time==row*col)break;
}