yes, using count i solved this, but IMHO, this should be done without this count somehow..
Best Regards Ashish Goel "Think positive and find fuel in failure" +919985813081 +919966006652 On Fri, Jun 15, 2012 at 3:14 PM, utsav sharma <[email protected]>wrote: > check no. of elements printed in all inner for loop also > > for (int j=c;j<n-c-1 && cnt<m*n;j++) {printf("%d ",a[r][j]); cnt++;} > for (int i=r;i<m-r-1 && cnt<m*n;i++) {printf("%d ",a[i][n-c-1]); cnt++} > for (int j=n-c-1 && cnt<m*n;j>c;j--) {printf("%d ",a[m-r-1][j]); cnt++} > for (int i=m-r-1 && cnt<m*n;i>r;i--) {printf("%d ",a[i][c]); cnt++} > > > On Fri, Jun 15, 2012 at 2:10 PM, Guneesh Paul Singh > <[email protected]>wrote: > >> void spiral(int a[][],int m,int n) >> { >> int c=1; >> >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to [email protected]. >> To unsubscribe from this group, send email to >> [email protected]. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > > > -- > Utsav Sharma, > NIT Allahabad > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
