I'm reading The Algorithm Design Manual. Spontaneously, I implement examples in the book by myself with the language, which is also spontaneously chosen.
What I learned
Data.Array.Diff: to update a pure array with O(1) time,
use: easy access to states wrapped by Monad
>>>: intuitive chaining functions
&: to call functions as if it's object's method.
>>> improved readability so much compared to writing only with
.. This is an example:
- Use existing graph library in haskell
- Use Kleisli arrows composition
- Use mutable collection data for better performance with