Review, suggestion etc?

[Grant Edwards]

On 2020-12-18, Joe Pfeiffer <pfeiffer at cs.nmsu.edu> wrote:
> Grant Edwards <grant.b.edwards at gmail.com> writes:
>
>> Yep, there are definitly cases where it's pretty much the only right
>> answer. If you try to avoid it, you end up writing what turns into a
>> simulation of recursion -- and doing that correctly isn't easy.
>
> Decades ago I had to write a binary tree search in FORTRAN IV.  It
> wasn't pretty.

I saw somebody try to write a graph search in GW-BASIC once. It was a
huge mess, and wasn't anywhere close to working. Doing the same thing
recursively was trivial -- even in C. In Python it wuld have been
even trivialler.

--
Grant