News for hackers. Stuff that matters.
Re:What is the asymptotic cost of purely functional programm... by dhconnelly on Wednesday April 11, 2012 @04:28PM (#3829488)
So you're arguing that all algorithms on a bounded-memory machine (that is, all of them) are O(1). Sure, but that constant in the O(1) is sufficiently large on most machines that this isn't useful to programmers who need to analyze the run times of their algorithms.

There are no comments on this comment yet.