Student: sriram
Assignment: 2
Grader: Damian

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

Bresenham:

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

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):				5
----------------------------------------------
total (100):					100


Comments:
----------------------------------------------

Bresenham:
Good job. Nice implementation.

Cohen-Sutherland:
Another nice job. Note that in some cases a recursive version of this
algorithm works faster, because you are able to trivially
accept/reject after clipping against each boundary, rather than having
to go through all the boundary tests (like you do in this case).


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