Guarantee some algorithmic complexities? Marc Nieper-Wi├čkirchen (16 Jun 2021 09:50 UTC)
Re: Guarantee some algorithmic complexities? Ray Dillinger (16 Jun 2021 15:56 UTC)
Re: Guarantee some algorithmic complexities? Wolfgang Corcoran-Mathe (16 Jun 2021 17:41 UTC)
Re: Guarantee some algorithmic complexities? Marc Nieper-Wi├čkirchen (16 Jun 2021 18:16 UTC)
Re: Guarantee some algorithmic complexities? Wolfgang Corcoran-Mathe (18 Jun 2021 19:42 UTC)
Re: Guarantee some algorithmic complexities? Wolfgang Corcoran-Mathe (18 Jun 2021 19:54 UTC)

Re: Guarantee some algorithmic complexities? Wolfgang Corcoran-Mathe 16 Jun 2021 17:41 UTC

On 2021-06-16 11:50 +0200, Marc Nieper-Wißkirchen wrote:
> I think it can be a good idea to add guaranteed average running times to
> the procedures.

I don't want to do this, simply because there are different notions of
what constitutes an acceptable implementation of SRFI 224.  Some
implementors might want fxmappings with fast lookup/update at the cost
of slow set-theoretical operations; others might want the two to be
balanced, and some might focus on space and ignore time complexity
entirely.  I don't see how meaningful bounds can be placed on SRFI
224's forms without creating a strait-jacket.

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

"Correctness is clearly the prime quality.  If a system does
not do what it is supposed to do, then everything else about
it matters little." --Bertrand Meyer