3 ms·
The first "wow, neat" moment of the article is the single-pass Haskell function that replaces every element of a list with that list's largest element. Haskell'
by Smaug123 8y ago
The first "wow, neat" moment of the article is the single-pass Haskell function that replaces every element of a list with that list's largest element. Haskell's laziness makes for some crazy possibilities and some totally incomprehensible performance properties.