Re:The ancient world before computers had stacks or heaps
by nerpderp82 on Wednesday April 03, 2024 @01:14PM
(#39920159)
Recursion is like an inductive proof, you can show it is correct and it normally fits on half of a small screen.
[ Parent
| on HN ]
Re:The ancient world before computers had stacks or heaps
by Joel_Mckay on Wednesday April 03, 2024 @01:42PM
(#39920546)
There is an argument that all recursive proofs can be made iterative due to isomorphism.
You are not lazy enough to be a good programmer yet. ;-)
Re:The ancient world before computers had stacks or heaps
by nerpderp82 on Thursday April 04, 2024 @01:45PM
(#39933644)
Yeah, but that is error prone and more complex. A compiler can make those same transformations. I'd argue that the properly lazy programmer is the one using recursion. To get even lazier, one should move into relational algebra.
Re:The ancient world before computers had stacks or heaps
by Joel_Mckay on Thursday April 04, 2024 @03:17PM
(#39934633)
Meh, or just choose a documented data structure that supports your problem scope. If it takes longer than 1 coffee, than someone is usually approaching things the wrong way...
Have to think "minimum effort" here... ;-)
Re:The ancient world before computers had stacks or heaps
by nerpderp82 on Friday April 05, 2024 @05:07PM
(#39947233)
I have seen 150 lines of SQL replaced with 12k lines of Java.
Re:The ancient world before computers had stacks or heaps
by Joel_Mckay on Friday April 05, 2024 @09:31PM
(#39949219)
Only 12k lines?
That is efficient for most Java programmers. =)
Re:The ancient world before computers had stacks or heaps
by nerpderp82 on Monday April 08, 2024 @01:42PM
(#39972034)
Thank you! :)