Bresenham Line Algorithm

void draw_line(int x0, int y0, int x1, int y1)

int x,y=y0;dx = 2*(x1-x0),dy = 2*(y1-y0)

int dydx = dy - dx, d = dy - dx/2;

for(x=x0; x<=x1; x++){

draw_pixel(x,y);

if(dɘ) {d+= dy;}

else {y+=1; d += dydx;}

}

/* this does the right thing (same as DDA) at */

/* a cost of 2 or 3 integer adds per point. */

/* (assumes sorted endpoints, 0<slopeə) */