Version française
Home     About     Download     Resources     Contact us    
Browse thread
Set union
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Radu Grigore <radugrigore@g...>
Subject: Re: [Caml-list] Complexity of Set.union
On Fri, 25 Feb 2005 23:50:25 +0200, Radu Grigore <radugrigore@gmail.com> wrote:
> > > That
> > > could indeed run in constant time (just join the two sets with a
> > > "Node" constructor), but I doubt the current implementation achieves
> > > this because of the repeated splitting.
> 
> What splitting? I see none in this case.

30s later and I see it :)

-- 
regards,
 radu
http://rgrig.blogspot.com/