From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Delivered-To: caml-list@yquem.inria.fr Received: from nez-perce.inria.fr (nez-perce.inria.fr [192.93.2.78]) by yquem.inria.fr (Postfix) with ESMTP id 2EF98BC75 for ; Fri, 25 Feb 2005 23:31:16 +0100 (CET) Received: from rproxy.gmail.com (rproxy.gmail.com [64.233.170.195]) by nez-perce.inria.fr (8.13.0/8.13.0) with ESMTP id j1PMVFrH018866 for ; Fri, 25 Feb 2005 23:31:15 +0100 Received: by rproxy.gmail.com with SMTP id a36so164663rnf for ; Fri, 25 Feb 2005 14:31:15 -0800 (PST) DomainKey-Signature: a=rsa-sha1; q=dns; c=nofws; s=beta; d=gmail.com; h=received:message-id:date:from:reply-to:to:subject:cc:in-reply-to:mime-version:content-type:content-transfer-encoding:references; b=P3uY3QiqhW0Dw9nuKQGRCWyEJZSDT/n65SrUH1AP2oDA4xwKAipmaql0+7PJS+FtsgZrA2U4FZew9iqMEEnJCPJ+q8W7Rf+iv6otX57LMfucMLP8p1WrSnr2cIvtAViSnIy73EgqoZphG29V78KKtvgV6Sx0aQ2QZyR5qUXPqdI= Received: by 10.38.163.44 with SMTP id l44mr145848rne; Fri, 25 Feb 2005 14:31:15 -0800 (PST) Received: by 10.38.65.58 with HTTP; Fri, 25 Feb 2005 14:31:14 -0800 (PST) Message-ID: <7f8e92aa0502251431653c0ac2@mail.gmail.com> Date: Sat, 26 Feb 2005 00:31:14 +0200 From: Radu Grigore Reply-To: Radu Grigore To: Jon Harrop Subject: Re: [Caml-list] Complexity of Set.union Cc: caml-list@yquem.inria.fr In-Reply-To: <7f8e92aa0502251350202ec368@mail.gmail.com> Mime-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit References: <200502240920.04902.jon@jdh30.plus.com> <200502251730.13003.jon@jdh30.plus.com> <20050225174853.GA25527@yquem.inria.fr> <200502251947.46657.jon@jdh30.plus.com> <7f8e92aa0502251350202ec368@mail.gmail.com> X-Miltered: at nez-perce with ID 421FA733.000 by Joe's j-chkmail (http://j-chkmail.ensmp.fr)! X-Spam: no; 0.00; caml-list:01 wrote:01 logarithmic:01 btw:02 radu:05 radu:05 indeed:05 fri:05 complexity:07 complexity:07 feb:09 something:12 set:13 set:13 then:17 X-Spam-Checker-Version: SpamAssassin 3.0.2 (2004-11-16) on yquem.inria.fr X-Spam-Status: No, score=0.0 required=5.0 tests=RCVD_BY_IP autolearn=disabled version=3.0.2 X-Spam-Level: On Fri, 25 Feb 2005 23:50:25 +0200, Radu Grigore wrote: > The complexity of set_union is indeed O(n+N), see [0]. Ah, BTW, if you do something like set_union(..., inserter(s)); where s is a set then inserter has logarithmic complexity so overall you get O((n+N) lg(n+N)). -- regards, radu http://rgrig.blogspot.com/