3 ms·
Recursion is like an inductive proof, you can show it is correct and it normally fits on half of a small screen.
by nerpderp82 3y ago
Recursion is like an inductive proof, you can show it is correct and it normally fits on half of a small screen.
- Joel_Mckay 3y agoThere 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. ;-)
- nerpderp82 3y agoYeah, 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.
- Joel_Mckay 3y agoMeh, 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... ;-)
- nerpderp82 3y agoI have seen 150 lines of SQL replaced with 12k lines of Java.
- Joel_Mckay 3y agoOnly 12k lines? That is efficient for most Java programmers. =)
- nerpderp82 3y agoThank you! :)