Re: filling area by color atack safety

On 16/03/2024 13:55, Ben Bacarisse wrote:

Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes:
 

Recursion make programs harder to reason about and prove correct.

 Are you prepared to offer any evidence to support this astonishing
statement or can we just assume it's another Malcolmism?
 

Example given. A recursive algorithm which is hard to reason about and prove correct, because we don't really know whether under perfectly reasonable assumptions it will or will not blow the stack.
--
Check out Basic Algorithms and my other books:
https://www.lulu.com/spotlight/bgy1mm