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.0 required=5.0 tests=BAYES_00,FORGED_HOTMAIL_RCVD2, FREEMAIL_FROM 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-7-bit Received: by 10.68.220.230 with SMTP id pz6mr25378415pbc.3.1340263474320; Thu, 21 Jun 2012 00:24:34 -0700 (PDT) Path: l9ni2382pbj.0!nntp.google.com!news1.google.com!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail From: Austin Obyrne Newsgroups: comp.lang.ada Subject: Re: My Invention of "Bug Sort". Date: Thu, 21 Jun 2012 00:24:33 -0700 (PDT) Organization: http://groups.google.com Message-ID: References: <3852c348-a728-44ed-b065-c8a596c1e235@googlegroups.com> <698085ff-6ca3-4a0e-b963-11bdcf11e6b5@googlegroups.com> NNTP-Posting-Host: 31.52.108.135 Mime-Version: 1.0 X-Trace: posting.google.com 1340263474 2662 127.0.0.1 (21 Jun 2012 07:24:34 GMT) X-Complaints-To: groups-abuse@google.com NNTP-Posting-Date: Thu, 21 Jun 2012 07:24:34 +0000 (UTC) In-Reply-To: Complaints-To: groups-abuse@google.com Injection-Info: glegroupsg2000goo.googlegroups.com; posting-host=31.52.108.135; posting-account=pmkN8QoAAAAtIhXRUfydb0SCISnwaeyg User-Agent: G2/1.0 Content-Type: text/plain; charset=ISO-8859-1 Date: 2012-06-21T00:24:33-07:00 List-Id: On Thursday, June 21, 2012 2:17:52 AM UTC+1, Jeffrey R. Carter wrote: > 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. Many thanks for that. I realise now you have said it (it's coming back to me )that Big O is complexity notation. I understand it all beter now. I'm a retired ships' engineer (pensioner) so you will undertsand why I am not as au fait as you guys who are 'hands-on' so speak exponents. This has been an enlightening experience in sorting techniques. My interest in cryptography brought me to sorting only after I notice an implementation to sorting in Ada. Serendipity you might say with some generosity. Summarising. I have uncovered an implementaion in Ada of an existing sort type program. I consider this a rather novel use of the language that is extensible to other languages - it is not important that this is not groundbreaking stuff after but I will continue with my demonstration programs in case anybody is interested. Really grateful, Austin O'Byrne