Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.lang.javascript > #34242

Re: Sort at least 5 times faster then native and quicksort

Show all headers | View raw

Den söndag 29 oktober 2017 kl. 16:46:47 UTC+1 skrev Ben Bacarisse:
> 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.

Nope should i?

Back to comp.lang.javascript | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread

Thread

Sort at least 5 times faster then native and quicksort jonas.thornvall@gmail.com - 2017-10-28 21:27 -0700
  Re: Sort at least 5 times faster then native and quicksort jonas.thornvall@gmail.com - 2017-10-28 21:41 -0700
  Re: Sort at least 5 times faster then native and quicksort jonas.thornvall@gmail.com - 2017-10-29 03:53 -0700
    Re: Sort at least 5 times faster then native and quicksort jonas.thornvall@gmail.com - 2017-10-29 04:33 -0700
  Re: Sort at least 5 times faster then native and quicksort jonas.thornvall@gmail.com - 2017-10-29 04:37 -0700
  Re: Sort at least 5 times faster then native and quicksort Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-29 12:10 +0000
    Re: Sort at least 5 times faster then native and quicksort jonas.thornvall@gmail.com - 2017-10-29 05:53 -0700
      Re: Sort at least 5 times faster then native and quicksort jonas.thornvall@gmail.com - 2017-10-29 06:01 -0700
      Re: Sort at least 5 times faster then native and quicksort Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-29 14:47 +0000
        Re: Sort at least 5 times faster then native and quicksort jonas.thornvall@gmail.com - 2017-10-29 08:13 -0700
          Re: Sort at least 5 times faster then native and quicksort Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-29 15:46 +0000
            Re: Sort at least 5 times faster then native and quicksort jonas.thornvall@gmail.com - 2017-10-29 08:49 -0700
              Re: Sort at least 5 times faster then native and quicksort Tim Streater <timstreater@greenbee.net> - 2017-10-29 16:16 +0100
            Re: Sort at least 5 times faster then native and quicksort jonas.thornvall@gmail.com - 2017-10-29 08:52 -0700
            Re: Sort at least 5 times faster then native and quicksort jonas.thornvall@gmail.com - 2017-10-29 08:58 -0700
              Re: Sort at least 5 times faster then native and quicksort Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-29 16:18 +0000
                Re: Sort at least 5 times faster then native and quicksort jonas.thornvall@gmail.com - 2017-10-29 09:36 -0700
                Re: Sort at least 5 times faster then native and quicksort jonas.thornvall@gmail.com - 2017-10-29 09:48 -0700
                Re: Sort at least 5 times faster then native and quicksort Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-29 18:02 +0000
                Re: Sort at least 5 times faster then native and quicksort jonas.thornvall@gmail.com - 2017-10-29 20:51 -0700
                Re: Sort at least 5 times faster then native and quicksort Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-30 09:31 +0000
                Re: Sort at least 5 times faster then native and quicksort jonas.thornvall@gmail.com - 2017-10-30 03:14 -0700
                Re: Sort at least 5 times faster then native and quicksort Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-30 10:31 +0000
                Re: Sort at least 5 times faster then native and quicksort jonas.thornvall@gmail.com - 2017-10-30 03:35 -0700
                Re: Sort at least 5 times faster then native and quicksort Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-30 14:19 +0000
                Re: Sort at least 5 times faster then native and quicksort jonas.thornvall@gmail.com - 2017-11-02 14:38 -0700
                Re: Sort at least 5 times faster then native and quicksort jonas.thornvall@gmail.com - 2017-11-02 14:42 -0700
                Re: Sort at least 5 times faster then native and quicksort jonas.thornvall@gmail.com - 2017-10-30 03:44 -0700
                Re: Sort at least 5 times faster then native and quicksort jonas.thornvall@gmail.com - 2017-10-30 03:50 -0700
                Re: Sort at least 5 times faster then native and quicksort Wally W. <ww84wa@aim.com> - 2017-10-30 06:40 -0400
                Re: Sort at least 5 times faster then native and quicksort jonas.thornvall@gmail.com - 2017-10-30 03:48 -0700
                Re: Sort at least 5 times faster then native and quicksort jonas.thornvall@gmail.com - 2017-10-30 03:32 -0700
                Re: Sort at least 5 times faster then native and quicksort jonas.thornvall@gmail.com - 2017-10-30 03:37 -0700
        Re: Sort at least 5 times faster then native and quicksort jonas.thornvall@gmail.com - 2017-10-29 08:35 -0700
    Re: Sort at least 5 times faster then native and quicksort jonas.thornvall@gmail.com - 2017-10-29 06:07 -0700
      Re: Sort at least 5 times faster then native and quicksort Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-29 14:37 +0000
    Re: Sort at least 5 times faster then native and quicksort jonas.thornvall@gmail.com - 2017-10-29 06:23 -0700
      Re: Sort at least 5 times faster then native and quicksort Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-29 14:50 +0000

csiph-web