Turn O(n^2) reverse into O(n)

Re:Turn O(n^2) reverse into O(n) by microtherion on Monday December 16, 2013 @07:33AM (#6914342)

I suppose what Alan Perlis said about LISP programmers—that they know the value of everything and the cost of nothing—is true for Haskell programmers as well.

[ Parent | on HN ]

Re:Turn O(n^2) reverse into O(n) by kovalkos on Monday December 16, 2013 @09:05AM (#6914716)

This is a bad application of the quote.

Most of the Lisp hackers are usually knowledgeable about analysis of algorithm complexity.

Alan Perlis comment talks about inefficiency of Lisp programs due to a lot of (meta) abstraction and indirect mapping of abstract software to hardware.

[ Parent | on HN ]

Re:Turn O(n^2) reverse into O(n) by microtherion on Tuesday December 17, 2013 @08:53PM (#6925396)

Admittedly, this particular case seems amenable to fairly straightforward algorithmic complexity analysis, but it seems to me that the lazy nature of Haskell seems to make it even harder to get a good grasp of costs involved than in a language like Lisp.

[ Parent | on HN ]