**Bresenham line drawing Algorithm:**

Input: point_{1} = (x_{1}, y_{1}) = (-2, 3) , = ( x_{1}, y_{1}) = (8, 10)

Step 1: Start the program.

Step 2: Initialize the graphics mode using init graph function.

Step 3: Accept the input at starting and endpoint of the line to be drawn.

Step 4: Load (x_{i}, y_{i}) into the frame buffer to be plotted as a first point.

Step 5: Calculate the constants delta x, delta y, 2delta y - 2delta x and obtain the first decision parameter p_{0}= 2delta y - 2delta x

Step 6: At each along the line starting at *k* = 0 perform the following test:

· If P_{k} < 0, then

o the next point is (X_{k+1} ,y_{k} ),

o p_{k+1}= p_{k} + 2delta y

· If p_{k} >= 0 , then

o the next point to the plotted is (x_{k+1} , y_{k+1}),

o p_{k+1} =p_{k}+ 2delta y - 2delta x

Step 7: Repeat the process until the end point of the line to be drawn is encountered.

Step 8: Stop the program.