Bresenham Circle Algorithm Implementation in C

# include<stdio.h>
# include<conio.h>
# include<graphics.h>

void main()
{
 int gd=DETECT,gm;
 int r,x,y,p,xc=320,yc=240,i;

 initgraph(&gd,&gm,"..\\BGI");

 printf("Enter the radius ");
 scanf("%d",&r);

 for(i=0;i<10;i++);
 {
 x=0;
 y=r;
 //putpixel(xc+x,yc-y,15);

 p=3-(2*r);

 for(x=0;x<=y;x++)
 {
 if (p<0)
 {
  y=y;
  p=(p+(4*x)+6);
 }
 else
 {
  y=y-1;

  p=p+((4*(x-y)+10));
 }

 putpixel(xc+x,yc-y,15);
 putpixel(xc-x,yc-y,15);
 putpixel(xc+x,yc+y,15);
 putpixel(xc-x,yc+y,15);
 putpixel(xc+y,yc-x,15);
 putpixel(xc-y,yc-x,15);
 putpixel(xc+y,yc+x,15);
 putpixel(xc-y,yc+x,15);

 }

 r=r-10;
 //xc=xc-5;
 //yc=yc-5;
 }
 getch();
 closegraph();
}