INTERSECTION on LW used to be O(n^2) but that was some years ago and I think it
got fixed. I don’t have an implementation to hand...
- nick
> On 23 Jan 2021, at 17:37, Marco Antoniotti wrote:
>
>
> Right.
>
> Yep. The question was stupid. Sorry.
>
> MA
>
>
>> On Sat, Jan 23, 2021 a
Right.
Yep. The question was stupid. Sorry.
MA
On Sat, Jan 23, 2021 at 6:35 PM Elias Mårtenson wrote:
> On Sun, 24 Jan 2021 at 00:40, Marco Antoniotti
> wrote:
>
>> Hello everybody
>>
>> I remember from the trenches that LW implementation of INTERSECTION and
>> UNION does not have (exp
On Sun, 24 Jan 2021 at 00:40, Marco Antoniotti
wrote:
> Hello everybody
>
> I remember from the trenches that LW implementation of INTERSECTION and
> UNION does not have (expected) linear time complexity.
>
> Before I go ahead checking the various implementations, does anybody know
> what is the
Hello everybody
I remember from the trenches that LW implementation of INTERSECTION and
UNION does not have (expected) linear time complexity.
Before I go ahead checking the various implementations, does anybody know
what is the time complexity of, at least, FIND, FIND-IF, POSITION and
POSITION-I
