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=-1.9 required=5.0 tests=BAYES_00 autolearn=ham
	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-7-bit
Received: by 10.68.196.232 with SMTP id ip8mr24432522pbc.6.1340241574834;
        Wed, 20 Jun 2012 18:19:34 -0700 (PDT)
Path: 
 l9ni1448pbj.0!nntp.google.com!news1.google.com!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail
From: "Jeffrey R. Carter" <ggsub@pragmada.co.cc>
Newsgroups: comp.lang.ada
Subject: Re: My Invention of "Bug Sort".
Date: Wed, 20 Jun 2012 18:17:52 -0700 (PDT)
Organization: http://groups.google.com
Message-ID: <f7534a7c-e905-4a01-ac57-e209f2f43671@googlegroups.com>
References: <3852c348-a728-44ed-b065-c8a596c1e235@googlegroups.com>
 <698085ff-6ca3-4a0e-b963-11bdcf11e6b5@googlegroups.com>
 <f79c7163-917d-4e18-8cdc-8c7ffb8cfde3@googlegroups.com>
NNTP-Posting-Host: 184.20.201.198
Mime-Version: 1.0
X-Trace: posting.google.com 1340241574 1853 127.0.0.1 (21 Jun 2012 01:19:34
 GMT)
X-Complaints-To: groups-abuse@google.com
NNTP-Posting-Date: Thu, 21 Jun 2012 01:19:34 +0000 (UTC)
In-Reply-To: <f79c7163-917d-4e18-8cdc-8c7ffb8cfde3@googlegroups.com>
Complaints-To: groups-abuse@google.com
Injection-Info: glegroupsg2000goo.googlegroups.com;
 posting-host=184.20.201.198;
 posting-account=uInPWgoAAAD9VvUJDc0jNwDhBg_137JZ
User-Agent: G2/1.0
Content-Type: text/plain; charset=ISO-8859-1
Date: 2012-06-20T18:17:52-07:00
List-Id: <comp.lang.ada>

On Wednesday, June 20, 2012 4:59:24 PM UTC-7, Austin Obyrne wrote:
> 
> <<<<<< This is another general sorting algorithm that is O(N log N). 
> 
>  I don't have the time to digress into a study of how this is arrived at so could I ask you to fill me briefly as follows.
> 
> 1) Does this take into account repeats of elemental numbers or does it assume no repeats in a sample.

It is irrespective of whether or not a value occurs more than once.

> 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.

> 3) Is 'N' the sample length or the array length.

Typically in comparison sorts the 2 are the same, but N refers to the number of values being sorted.