Student: rdror
Assignment: 2
Grader: Damian

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

Bresenham:

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

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


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

Bresenham Algorithm:
You were supposed to avoid using divide operations, but you used a "/2" in there somewhere. Note you didn't need to do this. You could have multiplied everything by 2*denom instead of just multiplying everything by "denom".

Cohen-Sutherland Algorithm:
Okay, you really should have tried to write the recursive version of Cohen-Sutherland. The version you have works but is a little ugly.


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