I'm just learning Haskell, and trying to figure out the most idiomatic way to implement a line of sight algorithm.
The demo code I found uses the state monad, but it seem simpler to me (I'm just a beginner) to pass state recursively. What am I missing here? Are there performance problems?
Find code at: http://www.finalcog.com/bresenham-algorithm-idiomatic-haskell
Thanks,
Chris.