We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
yet I read on haskell.org/prelude, "Also note that if you want an efficient left-fold, you probably want to use foldl' instead of foldl." So maybe this isn't that efficient? Can you say a word about this? (I'm a complete newbie... :-))
Reverse a List
You are viewing a single comment's thread. Return to all comments →
yet I read on haskell.org/prelude, "Also note that if you want an efficient left-fold, you probably want to use
foldl'
instead offoldl
." So maybe this isn't that efficient? Can you say a word about this? (I'm a complete newbie... :-))