Path: csiph.com!eternal-september.org!feeder.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: Ben Bacarisse <ben.usenet@bsb.me.uk>
Newsgroups: comp.lang.javascript
Subject: Re: Sort at least 5 times faster then native and quicksort
Date: Sun, 29 Oct 2017 15:46:42 +0000
Organization: A noiseless patient Spider
Lines: 53
Message-ID: <8760ayt0rh.fsf@bsb.me.uk>
References: <8c8816a1-0e4f-4bb4-8a52-94f434e4d599@googlegroups.com> <87d156upbm.fsf@bsb.me.uk> <7e903b8b-9d99-4560-8649-960e05bd58ea@googlegroups.com> <87mv4at3ip.fsf@bsb.me.uk> <515373f2-5b03-4a89-b776-d47a542aa83e@googlegroups.com>
Mime-Version: 1.0
Content-Type: text/plain; charset=iso-8859-1
Content-Transfer-Encoding: 8bit
Injection-Info: reader02.eternal-september.org; posting-host="b252f5705e435813dbfff633d4cae81b"; logging-data="13381"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1+JFBIpB7Q4c8A3tk11nsTaosXCtcG/+28="
Cancel-Lock: sha1:OVO5Rc3o5JrGgsC7yoqWVRsS3yg= sha1:QqT9Eu+m0tt2JC4zkpWVZkKJ2w0=
Xref: csiph.com comp.lang.javascript:34241

jonas.thornvall@gmail.com writes:

> Den söndag 29 oktober 2017 kl. 15:47:14 UTC+1 skrev Ben Bacarisse:
>> jonas.thornvall@gmail.com writes:
>> 
>> > Den söndag 29 oktober 2017 kl. 13:10:59 UTC+1 skrev Ben Bacarisse:
>> >> jonas.thornvall@gmail.com writes:
>> >> 
>> >> > My sort Algorithm is at least 5 time faster then native and quicks
>> >> > sort for densely populated samples "where numbers have 1 or more
>> >> > occurences".
>> >> 
>> >> It's not really your algorithm, it's your implementation of a well-known
>> >> algorithm.
>> <snip>
>> > Well it is my algorithm invented out of bucket sort that was known in
>> > the 80's. This was not known because back then the dinosaurs did think
>> > different because of memory requirment and so on. But you see average
>> > Joe did it already back then because they did not understand better
>> > and when they saw that it was really good for big samples with a small
>> > range they knew it was faster and better then quicksort. But it was
>> > never appreciated.
>> 
>> I don't see how you can claim to know the literature well enough to make
>> grandiose claims like this.  Knuth (in TAOCP) says it was invented in
>> the early 1950s.  I knew it well in 1970s though I could not have told
>> you then how invented it.
<snip>
> You are silly Ben the 1950's computers used transistor and radio
> tubes, the memories was mercury delay line programs and data was
> either on card or switches.

No, it's silly of you to question a very well-researched work like
Knuth's TAOCP.  Harold Seward's in 1954 PhD thesis is even available
online.  You can see the algorithm there as pain as day.  You think your
limited knowledge of computer history is all there is.  Some algorithms
were even invented before there were digital computers.

> Well you can ask the guys that renovated Edsac to implement my
> algorithm, they have to be very fast flipping the switches read the
> data in LoL

You don't need a computer to have an algorithm, but as it happens,
Harold Seward's work was motivated by having very little fast memory.
You therefore need a method that works well with very slow memory.  A
counting sort is very good for that situation.

> Well your a funny guy Ben, not that bright but funny ;)

Have you heard of the Dunning-Kruger effect?

-- 
Ben.