Student:
Assignment: 2
Grader:

************************************************

Bresenham:

program runs (55): 55                  
correct implementation of Bresenham (20): 20 
no floats and divides (20): 5                 
extra credit (5): 4                          
----------------------------------------------
total (100): 89                                

Cohen-Sutherland:

program runs (55): 55                   
inside case correct (10): 10                   
outside case correct (10): 10                  
one clip correct (10): 10                      
two clips correct (10): 10                     
extra credit (5): -                           
----------------------------------------------
total (100): 95                                


Comments:
----------------------------------------------
Shifting bits is equivalent to dividing.  There
is a way to implement Bresenham using integers
only (no shifts, no divides, no nothing) outlined
in your textbooks and lecture.  This is the method
you were asked to implement.

*************************************************