Re:How recursion got into Algol 60: a comedy of errors
by anindyabd on Thursday August 27, 2015 @07:47PM
(#10132866)
I wouldn't call recursion boring. Quicksort in Haskell is probably my favorite two lines of code:
[ Parent
| on HN ]
Re:How recursion got into Algol 60: a comedy of errors
by nemesisrobot on Thursday August 27, 2015 @10:19PM
(#10133412)
It's been discussed before, but that's not really quicksort though (since it's not in-place)[0]
Re:How recursion got into Algol 60: a comedy of errors
by emmelaich on Friday August 28, 2015 @07:27AM
(#10134809)
Do we know that for sure?
I mean - could a sufficiently smart compiler actually create machine code which _did_ do it in-place?
Re:How recursion got into Algol 60: a comedy of errors
by jmount on Thursday August 27, 2015 @10:51PM
(#10133505)
This variant (with the <= comparison) takes c N^2 on lists of length N that a repeated constant ( http://www.win-vector.com/blog/2008/04/sorting-in-anger/ ).