Free Republic
Browse · Search
General/Chat
Topics · Post Article

To: Snowybear
Recursion may have been useful back in the old days when memory mattered but that’s no longer the case (unforunately). Anyone using it, in my experience, was showing off or stroking their ego.

You have to be joking. In the old days, recursion would often use more memory than a conventional iterative solution, because of growth of stack. Tail recursion, a more efficient form invented in the 1980s, has the same memory footprint as iteration.

Now that memory and processing are almost infinite, the key bottleneck is the ability of a programmer to understand a program. Recursion can often make programs shorter and simpler.

559 posted on 12/28/2019 10:43:47 PM PST by AZLiberty (218 House seats or bust! Bust. But the Dems will be busted for election fraud.)
[ Post Reply | Private Reply | To 517 | View Replies ]


To: AZLiberty
Now that memory and processing are almost infinite, the key bottleneck is the ability of a programmer to understand a program.

The bottleneck is the inability of the FIRST programmer to write non-obfuscated, non-spaghetti, clearly documented code.

The enemies are the bean counters (time) and business analysts (don't know what they want, but only how to say rather shakily, "I don't think that's quite what I wanted, but I don't know what I _do_ want."

561 posted on 12/28/2019 10:47:47 PM PST by grey_whiskers (The opinions are solely those of the author and are subject to change with out notice.)
[ Post Reply | Private Reply | To 559 | View Replies ]

Free Republic
Browse · Search
General/Chat
Topics · Post Article


FreeRepublic, LLC, PO BOX 9771, FRESNO, CA 93794
FreeRepublic.com is powered by software copyright 2000-2008 John Robinson