From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-0.3 required=5.0 tests=BAYES_00,
	REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4
X-Google-Thread: 103376,f6c360ce344b2364
X-Google-NewGroupId: yes
X-Google-Attributes: gida07f3367d7,domainid0,public,usenet
X-Google-Language: ENGLISH,ASCII
Received: by 10.68.193.129 with SMTP id ho1mr26182349pbc.8.1340280596446;
        Thu, 21 Jun 2012 05:09:56 -0700 (PDT)
Path: 
 l9ni3109pbj.0!nntp.google.com!news1.google.com!news.glorb.com!gegeweb.org!aioe.org!.POSTED!not-for-mail
From: "Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>
Newsgroups: comp.lang.ada
Subject: Re: My Invention of "Bug Sort".
Date: Thu, 21 Jun 2012 14:09:56 +0200
Organization: cbb software GmbH
Message-ID: <1u9ig9nnen59q$.ajozwlsekr7l.dlg@40tude.net>
References: <3852c348-a728-44ed-b065-c8a596c1e235@googlegroups.com>
 <698085ff-6ca3-4a0e-b963-11bdcf11e6b5@googlegroups.com>
 <f79c7163-917d-4e18-8cdc-8c7ffb8cfde3@googlegroups.com>
 <f7534a7c-e905-4a01-ac57-e209f2f43671@googlegroups.com>
 <m2lijhs0vn.fsf@pushface.org> <jruibm$gn2$1@speranza.aioe.org>
 <ea5e2e25-eaa5-41d1-bfad-6934df4bfb3f@googlegroups.com>
Reply-To: mailbox@dmitry-kazakov.de
NNTP-Posting-Host: FbOMkhMtVLVmu7IwBnt1tw.user.speranza.aioe.org
Mime-Version: 1.0
X-Complaints-To: abuse@aioe.org
User-Agent: 40tude_Dialog/2.0.15.1
X-Notice: Filtered by postfilter v. 0.8.2
Content-Type: text/plain; charset="iso-8859-1"
Content-Transfer-Encoding: 8bit
Date: 2012-06-21T14:09:56+02:00
List-Id: <comp.lang.ada>

On Thu, 21 Jun 2012 04:50:34 -0700 (PDT), Austin Obyrne wrote:

> On Thursday, June 21, 2012 8:23:12 AM UTC+1, Manuel Collado wrote:
>> El 21/06/2012 7:13, Simon Wright escribi�:
>>> "Jeffrey R. Carter"<ggsub@pragmada.co.cc>  writes:
>>>
>>>>> 2 ) In "O(N log N)" do I assume log to the base 'e' or what.
>>>>
>>>> In "Big-O" notation, log is understood to be to the base 2.
>>>
>>> Isn't there a constant factor between log2(x) and ln(x)? Which is taken
>>> up in the O?
>>>
>>>     N = e**x = 2**y
>>>
>>> Taking natural logs,
>>>
>>>     ln N = x = y.ln 2
>> 
>> Yes. In "Big-O" notation, the base for log() is irrelevant.
>> 
>>    O(log N) = O(ln N)
>> 
>> Both expressions denote exactly the same set of functions.

> This is surprising to me - is it right?

Yes, O(nX)=O(Y) for all n>0.

O(f)=O(g) when lim f/g exists, finite, non-zero.

http://en.wikipedia.org/wiki/Big_O_notation

-- 
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de