Student: jialun
Assignment: 2
Grader: Charlie

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

Bresenham:

program runs, buggy (55):                   55
correct implementation of Bresenham (20):   20
no floats and divides (20):                 20
extra credit (5):                            2
----------------------------------------------
total (100):                                97

Cohen-Sutherland:

program runs, buggy (55):                   50
inside case correct (10):                   10
outside case correct (10):                  10
one clip correct (10):                      10
two clips correct (10):                     10
extra credit (5):                            0
----------------------------------------------
total (100):                                90


Comments:
----------------------------------------------
Bresenham:
You do not really need 8 separate loops to handle
all 8 octants of the Bresenham algorithm.
You can do it all in one loop if you setup
starting Xs and Ys and X and Y increments properly.

Cohen-Sutherland:
You could have reduced redundant code if you
defined the procedure recursively.

Why did you not use the LEFT, TOP, RIGHT, and
BOTTOM constants that were defined for you?
It would have made your code more readable.

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