Re: iset-search implementations Wolfgang Corcoran-Mathe 11 Jan 2021 00:27 UTC

On 2021-01-10 18:35 -0500, Wolfgang Corcoran-Mathe wrote:
> I may be wrong about this, but it seems that using *-search to,
> well, search for an element will consume O(n) space when traversing
> most recursive structures, with or without call/cc.

Correction: The lset example *would* make a number of recursive calls
asymptotically equal to the size of the set, but this would of course
be different for other structures.  (e.g. O(log n) frames rather than
O(n), etc.)

--
Wolfgang Corcoran-Mathe  <xxxxxx@sigwinch.xyz>

"The art of doing mathematics consists in finding that special case
which contains all the germs of generality." --David Hilbert