Student: jar
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:
Good job! You further simplify the code
by combining the 2 loops into 1... if you want.

Cohen-Sutherland:
You can simplify your code a lot by making this
a recursive procedure.
Also there are a lot of places where your code
is more complicated than necessary.

For example,
((((id1 & TOP) > 0) && ((id2 & TOP) > 0)) ||
 (((id1 & BOTTOM) > 0) && ((id2 & BOTTOM) > 0)) ||
 (((id1 & LEFT) > 0) && ((id2 & LEFT) > 0)) ||
 (((id1 & RIGHT) > 0) && ((id2 & RIGHT) > 0)))
is equivalent to
((id1 & id2)>0)

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