4 ms·
>It is hard to tease out which recursions we find because professors just like it, and which ones real-world problems demand As someone that works on real worl
by ChrisLomont 5y ago
>It is hard to tease out which recursions we find because professors just like it, and which ones real-world problems demand
As someone that works on real world problems all over the spectrum (google my name), I can say with extensive expertise that a significant number of problems are vastly better solved with recursion.
I didn't cite most of the list above because a textbook said so. It's because I use and design algorithms all over the map in all sorts of languages for a living, precisely for real world problems.
I take it you don't use this tool when appropriate do you?
- ncmncm 5y agoIn fact I always do.
- ChrisLomont 5y agoYet you've filled this thread with demonstrable fallacies regarding performance, overflowing stacks, and inability to see cleaner code. Odd.
- ncmncm 5y agoIn fact, I wrote none of those. I don't know what "inability to see cleaner code" even means, if anything, so I could not have made claims about it. But I wonder, do you really believe that overflowing one's stack is, universally, not possible?
- ChrisLomont 5y ago>In fact, I wrote none of those A quote from you: "You encounter it in the recursive case, painfully, when your stack overflows." And we're done.