Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.javascript > #34224 > unrolled thread
| Started by | jonas.thornvall@gmail.com |
|---|---|
| First post | 2017-10-28 21:27 -0700 |
| Last post | 2017-10-29 14:50 +0000 |
| Articles | 18 on this page of 38 — 4 participants |
Back to article view | Back to comp.lang.javascript
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
Page 2 of 2 — ← Prev page 1 [2]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2017-10-30 09:31 +0000 |
| Message-ID | <87r2tl0yo3.fsf@bsb.me.uk> |
| In reply to | #34253 |
jonas.thornvall@gmail.com writes: > Den söndag 29 oktober 2017 kl. 19:02:08 UTC+1 skrev Ben Bacarisse: >> jonas.thornvall@gmail.com writes: >> >> > Den söndag 29 oktober 2017 kl. 17:18:35 UTC+1 skrev Ben Bacarisse: >> >> jonas.thornvall@gmail.com writes: >> >> <snip> >> >> > You see this is so easy a 10 year old could implement it, and it is >> >> > way faster but it was never teached to anyone so noone ever used it to >> >> > sort LoL >> >> >> >> What? Now you claim to know what is taught. It is in TAOPC and it was >> >> taught in the university I taught at. Unlike you, I can't claim to be >> >> an expert in what other universities teach. >> <snip> >> > So i know it wasn't teached and noone i saw used it at university. >> >> How do you know that? > > Well we had one or two algorithm classes, when it come to speed there > was nothing else then quicksort and maybe bucketsort in rare cases. Oh, sorry. You only meant that you weren't taught it? I thought you where making a more general point with "it was never teached to anyone". Anyway, I think you were short-changed by those algorithm courses. There's a lot more to sorting the quicksort and bucket sort. Rest assured that many students are taught about counting sort. In fact it is soften used as as the sort function for the buckets in a bucket sort. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | jonas.thornvall@gmail.com |
|---|---|
| Date | 2017-10-30 03:14 -0700 |
| Message-ID | <eeae6028-1257-4070-8b68-a1bd5d2b467e@googlegroups.com> |
| In reply to | #34254 |
Den måndag 30 oktober 2017 kl. 10:31:45 UTC+1 skrev Ben Bacarisse: > jonas.thornvall@gmail.com writes: > > > Den söndag 29 oktober 2017 kl. 19:02:08 UTC+1 skrev Ben Bacarisse: > >> jonas.thornvall@gmail.com writes: > >> > >> > Den söndag 29 oktober 2017 kl. 17:18:35 UTC+1 skrev Ben Bacarisse: > >> >> jonas.thornvall@gmail.com writes: > >> >> <snip> > >> >> > You see this is so easy a 10 year old could implement it, and it is > >> >> > way faster but it was never teached to anyone so noone ever used it to > >> >> > sort LoL > >> >> > >> >> What? Now you claim to know what is taught. It is in TAOPC and it was > >> >> taught in the university I taught at. Unlike you, I can't claim to be > >> >> an expert in what other universities teach. > >> <snip> > >> > So i know it wasn't teached and noone i saw used it at university. > >> > >> How do you know that? > > > > Well we had one or two algorithm classes, when it come to speed there > > was nothing else then quicksort and maybe bucketsort in rare cases. > > Oh, sorry. You only meant that you weren't taught it? I thought you > where making a more general point with "it was never teached to anyone". > Anyway, I think you were short-changed by those algorithm courses. > There's a lot more to sorting the quicksort and bucket sort. Rest > assured that many students are taught about counting sort. In fact it > is soften used as as the sort function for the buckets in a bucket sort. > > -- > Ben. No i tell you noone have ever been taught it... Because it was to simple and to fast, so it would have killed the dinosaurs.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2017-10-30 10:31 +0000 |
| Message-ID | <87bmkp0vvz.fsf@bsb.me.uk> |
| In reply to | #34255 |
jonas.thornvall@gmail.com writes: > Den måndag 30 oktober 2017 kl. 10:31:45 UTC+1 skrev Ben Bacarisse: >> jonas.thornvall@gmail.com writes: >> >> > Den söndag 29 oktober 2017 kl. 19:02:08 UTC+1 skrev Ben Bacarisse: >> >> jonas.thornvall@gmail.com writes: >> >> >> >> > Den söndag 29 oktober 2017 kl. 17:18:35 UTC+1 skrev Ben Bacarisse: >> >> >> jonas.thornvall@gmail.com writes: >> >> >> <snip> >> >> >> > You see this is so easy a 10 year old could implement it, and it is >> >> >> > way faster but it was never teached to anyone so noone ever used it to >> >> >> > sort LoL >> >> >> >> >> >> What? Now you claim to know what is taught. It is in TAOPC and it was >> >> >> taught in the university I taught at. Unlike you, I can't claim to be >> >> >> an expert in what other universities teach. >> >> <snip> >> >> > So i know it wasn't teached and noone i saw used it at university. >> >> >> >> How do you know that? >> > >> > Well we had one or two algorithm classes, when it come to speed there >> > was nothing else then quicksort and maybe bucketsort in rare cases. >> >> Oh, sorry. You only meant that you weren't taught it? I thought you >> where making a more general point with "it was never teached to anyone". >> Anyway, I think you were short-changed by those algorithm courses. >> There's a lot more to sorting the quicksort and bucket sort. Rest >> assured that many students are taught about counting sort. In fact it >> is soften used as as the sort function for the buckets in a bucket sort. > > No i tell you noone have ever been taught it... Because it was to > simple and to fast, so it would have killed the dinosaurs. Well I can't stop you telling me this but (a) I was taught it, and (b) it is trivial to find lots of sets of course notes online that include counting sort in the content. What is it in your character that lets you deny such an obviously verifiable fact? BTW, how are you getting on with the bug you could not find? -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | jonas.thornvall@gmail.com |
|---|---|
| Date | 2017-10-30 03:35 -0700 |
| Message-ID | <f93f6bc1-77e1-448e-a115-2d06ce3af2b6@googlegroups.com> |
| In reply to | #34256 |
Den måndag 30 oktober 2017 kl. 11:31:49 UTC+1 skrev Ben Bacarisse: > jonas.thornvall@gmail.com writes: > > > Den måndag 30 oktober 2017 kl. 10:31:45 UTC+1 skrev Ben Bacarisse: > >> jonas.thornvall@gmail.com writes: > >> > >> > Den söndag 29 oktober 2017 kl. 19:02:08 UTC+1 skrev Ben Bacarisse: > >> >> jonas.thornvall@gmail.com writes: > >> >> > >> >> > Den söndag 29 oktober 2017 kl. 17:18:35 UTC+1 skrev Ben Bacarisse: > >> >> >> jonas.thornvall@gmail.com writes: > >> >> >> <snip> > >> >> >> > You see this is so easy a 10 year old could implement it, and it is > >> >> >> > way faster but it was never teached to anyone so noone ever used it to > >> >> >> > sort LoL > >> >> >> > >> >> >> What? Now you claim to know what is taught. It is in TAOPC and it was > >> >> >> taught in the university I taught at. Unlike you, I can't claim to be > >> >> >> an expert in what other universities teach. > >> >> <snip> > >> >> > So i know it wasn't teached and noone i saw used it at university. > >> >> > >> >> How do you know that? > >> > > >> > Well we had one or two algorithm classes, when it come to speed there > >> > was nothing else then quicksort and maybe bucketsort in rare cases. > >> > >> Oh, sorry. You only meant that you weren't taught it? I thought you > >> where making a more general point with "it was never teached to anyone". > >> Anyway, I think you were short-changed by those algorithm courses. > >> There's a lot more to sorting the quicksort and bucket sort. Rest > >> assured that many students are taught about counting sort. In fact it > >> is soften used as as the sort function for the buckets in a bucket sort. > > > > No i tell you noone have ever been taught it... Because it was to > > simple and to fast, so it would have killed the dinosaurs. > > Well I can't stop you telling me this but (a) I was taught it, and (b) > it is trivial to find lots of sets of course notes online that include > counting sort in the content. What is it in your character that lets > you deny such an obviously verifiable fact? > > BTW, how are you getting on with the bug you could not find? > > -- > Ben. It is not a bug in the algorithm Ben it is a feature to be able to optimise the algorithm by setting the range of the input data. But it is a bug in my script for sure.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2017-10-30 14:19 +0000 |
| Message-ID | <877evc1zwh.fsf@bsb.me.uk> |
| In reply to | #34258 |
jonas.thornvall@gmail.com writes: > Den måndag 30 oktober 2017 kl. 11:31:49 UTC+1 skrev Ben Bacarisse: <snip> >> BTW, how are you getting on with the bug you could not find? <snip> > It is not a bug in the algorithm Ben Yes, I know. In fact I know exactly what the bug. <snip> -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | jonas.thornvall@gmail.com |
|---|---|
| Date | 2017-11-02 14:38 -0700 |
| Message-ID | <90b21f6c-d579-433a-af2b-0e76f5ddb6e2@googlegroups.com> |
| In reply to | #34265 |
Den måndag 30 oktober 2017 kl. 15:19:47 UTC+1 skrev Ben Bacarisse: > jonas.thornvall@gmail.com writes: > > > Den måndag 30 oktober 2017 kl. 11:31:49 UTC+1 skrev Ben Bacarisse: > <snip> > >> BTW, how are you getting on with the bug you could not find? > <snip> > > It is not a bug in the algorithm Ben > > Yes, I know. In fact I know exactly what the bug. > > <snip> > -- > Ben. I too, i don't know why i put it there because it wasn't there to start with, but now it is gone.
[toc] | [prev] | [next] | [standalone]
| From | jonas.thornvall@gmail.com |
|---|---|
| Date | 2017-11-02 14:42 -0700 |
| Message-ID | <a8ada4e8-08b0-43df-8846-79f5f6877636@googlegroups.com> |
| In reply to | #34265 |
Den måndag 30 oktober 2017 kl. 15:19:47 UTC+1 skrev Ben Bacarisse: > jonas.thornvall@gmail.com writes: > > > Den måndag 30 oktober 2017 kl. 11:31:49 UTC+1 skrev Ben Bacarisse: > <snip> > >> BTW, how are you getting on with the bug you could not find? > <snip> > > It is not a bug in the algorithm Ben > > Yes, I know. In fact I know exactly what the bug. > > <snip> > -- > Ben. Well the bug was that I reinitialised the array, now it is probably 10 times faster. In a dense dataset population where each entry has at least 1 entry/member.
[toc] | [prev] | [next] | [standalone]
| From | jonas.thornvall@gmail.com |
|---|---|
| Date | 2017-10-30 03:44 -0700 |
| Message-ID | <0d2c0f21-1a9b-41e1-8cb3-c279afcbe085@googlegroups.com> |
| In reply to | #34256 |
Den måndag 30 oktober 2017 kl. 11:31:49 UTC+1 skrev Ben Bacarisse: > jonas.thornvall@gmail.com writes: > > > Den måndag 30 oktober 2017 kl. 10:31:45 UTC+1 skrev Ben Bacarisse: > >> jonas.thornvall@gmail.com writes: > >> > >> > Den söndag 29 oktober 2017 kl. 19:02:08 UTC+1 skrev Ben Bacarisse: > >> >> jonas.thornvall@gmail.com writes: > >> >> > >> >> > Den söndag 29 oktober 2017 kl. 17:18:35 UTC+1 skrev Ben Bacarisse: > >> >> >> jonas.thornvall@gmail.com writes: > >> >> >> <snip> > >> >> >> > You see this is so easy a 10 year old could implement it, and it is > >> >> >> > way faster but it was never teached to anyone so noone ever used it to > >> >> >> > sort LoL > >> >> >> > >> >> >> What? Now you claim to know what is taught. It is in TAOPC and it was > >> >> >> taught in the university I taught at. Unlike you, I can't claim to be > >> >> >> an expert in what other universities teach. > >> >> <snip> > >> >> > So i know it wasn't teached and noone i saw used it at university. > >> >> > >> >> How do you know that? > >> > > >> > Well we had one or two algorithm classes, when it come to speed there > >> > was nothing else then quicksort and maybe bucketsort in rare cases. > >> > >> Oh, sorry. You only meant that you weren't taught it? I thought you > >> where making a more general point with "it was never teached to anyone". > >> Anyway, I think you were short-changed by those algorithm courses. > >> There's a lot more to sorting the quicksort and bucket sort. Rest > >> assured that many students are taught about counting sort. In fact it > >> is soften used as as the sort function for the buckets in a bucket sort. > > > > No i tell you noone have ever been taught it... Because it was to > > simple and to fast, so it would have killed the dinosaurs. > > Well I can't stop you telling me this but (a) I was taught it, and (b) > it is trivial to find lots of sets of course notes online that include > counting sort in the content. What is it in your character that lets > you deny such an obviously verifiable fact? > > BTW, how are you getting on with the bug you could not find? > > -- > Ben. So would you like the imput range of data to be possible to parametrise/parameterise ? Should one think that the input range of elements in dataset "min max bitwidth" is known and inputs to the algorithm?
[toc] | [prev] | [next] | [standalone]
| From | jonas.thornvall@gmail.com |
|---|---|
| Date | 2017-10-30 03:50 -0700 |
| Message-ID | <f22b2516-ed20-4498-895d-d5be3df4f2cd@googlegroups.com> |
| In reply to | #34256 |
Den måndag 30 oktober 2017 kl. 11:31:49 UTC+1 skrev Ben Bacarisse: > jonas.thornvall@gmail.com writes: > > > Den måndag 30 oktober 2017 kl. 10:31:45 UTC+1 skrev Ben Bacarisse: > >> jonas.thornvall@gmail.com writes: > >> > >> > Den söndag 29 oktober 2017 kl. 19:02:08 UTC+1 skrev Ben Bacarisse: > >> >> jonas.thornvall@gmail.com writes: > >> >> > >> >> > Den söndag 29 oktober 2017 kl. 17:18:35 UTC+1 skrev Ben Bacarisse: > >> >> >> jonas.thornvall@gmail.com writes: > >> >> >> <snip> > >> >> >> > You see this is so easy a 10 year old could implement it, and it is > >> >> >> > way faster but it was never teached to anyone so noone ever used it to > >> >> >> > sort LoL > >> >> >> > >> >> >> What? Now you claim to know what is taught. It is in TAOPC and it was > >> >> >> taught in the university I taught at. Unlike you, I can't claim to be > >> >> >> an expert in what other universities teach. > >> >> <snip> > >> >> > So i know it wasn't teached and noone i saw used it at university. > >> >> > >> >> How do you know that? > >> > > >> > Well we had one or two algorithm classes, when it come to speed there > >> > was nothing else then quicksort and maybe bucketsort in rare cases. > >> > >> Oh, sorry. You only meant that you weren't taught it? I thought you > >> where making a more general point with "it was never teached to anyone". > >> Anyway, I think you were short-changed by those algorithm courses. > >> There's a lot more to sorting the quicksort and bucket sort. Rest > >> assured that many students are taught about counting sort. In fact it > >> is soften used as as the sort function for the buckets in a bucket sort. > > > > No i tell you noone have ever been taught it... Because it was to > > simple and to fast, so it would have killed the dinosaurs. > > Well I can't stop you telling me this but (a) I was taught it, and (b) > it is trivial to find lots of sets of course notes online that include > counting sort in the content. What is it in your character that lets > you deny such an obviously verifiable fact? > > BTW, how are you getting on with the bug you could not find? > > -- > Ben. Yeah the bugs they keep coming, fortunately there is people more driven than me to find them and correct them.
[toc] | [prev] | [next] | [standalone]
| From | Wally W. <ww84wa@aim.com> |
|---|---|
| Date | 2017-10-30 06:40 -0400 |
| Message-ID | <oqvdvchu3g7tap8q2rskvh7ukvtg5n0kcm@4ax.com> |
| In reply to | #34255 |
On Mon, 30 Oct 2017 03:14:10 -0700 (PDT), jonas.thornvall@gmail.com wrote: >Den måndag 30 oktober 2017 kl. 10:31:45 UTC+1 skrev Ben Bacarisse: >> jonas.thornvall@gmail.com writes: >> >> > Den söndag 29 oktober 2017 kl. 19:02:08 UTC+1 skrev Ben Bacarisse: >> >> jonas.thornvall@gmail.com writes: >> >> >> >> > Den söndag 29 oktober 2017 kl. 17:18:35 UTC+1 skrev Ben Bacarisse: >> >> >> jonas.thornvall@gmail.com writes: >> >> >> <snip> >> >> >> > You see this is so easy a 10 year old could implement it, and it is >> >> >> > way faster but it was never teached to anyone so noone ever used it to >> >> >> > sort LoL >> >> >> >> >> >> What? Now you claim to know what is taught. It is in TAOPC and it was >> >> >> taught in the university I taught at. Unlike you, I can't claim to be >> >> >> an expert in what other universities teach. >> >> <snip> >> >> > So i know it wasn't teached and noone i saw used it at university. >> >> >> >> How do you know that? >> > >> > Well we had one or two algorithm classes, when it come to speed there >> > was nothing else then quicksort and maybe bucketsort in rare cases. >> >> Oh, sorry. You only meant that you weren't taught it? I thought you >> where making a more general point with "it was never teached to anyone". >> Anyway, I think you were short-changed by those algorithm courses. >> There's a lot more to sorting the quicksort and bucket sort. Rest >> assured that many students are taught about counting sort. In fact it >> is soften used as as the sort function for the buckets in a bucket sort. >> >> -- >> Ben. > >No i tell you noone have ever been taught it... Because it was to simple and to fast, so it would have killed the dinosaurs. Everything that could be taught was covered in "one or two algorithm classes," right? We don't need quicksort, bucket sort, heap sort, etc., anymore because you have overcome the "dinosaurs" by publicizing the counting sort, right?
[toc] | [prev] | [next] | [standalone]
| From | jonas.thornvall@gmail.com |
|---|---|
| Date | 2017-10-30 03:48 -0700 |
| Message-ID | <5a43c3c0-e37a-457f-add6-0d618c2310ef@googlegroups.com> |
| In reply to | #34260 |
Den måndag 30 oktober 2017 kl. 11:40:11 UTC+1 skrev Wally W.: > On Mon, 30 Oct 2017 03:14:10 -0700 (PDT), jonas.thornvall@gmail.com > wrote: > > >Den måndag 30 oktober 2017 kl. 10:31:45 UTC+1 skrev Ben Bacarisse: > >> jonas.thornvall@gmail.com writes: > >> > >> > Den söndag 29 oktober 2017 kl. 19:02:08 UTC+1 skrev Ben Bacarisse: > >> >> jonas.thornvall@gmail.com writes: > >> >> > >> >> > Den söndag 29 oktober 2017 kl. 17:18:35 UTC+1 skrev Ben Bacarisse: > >> >> >> jonas.thornvall@gmail.com writes: > >> >> >> <snip> > >> >> >> > You see this is so easy a 10 year old could implement it, and it is > >> >> >> > way faster but it was never teached to anyone so noone ever used it to > >> >> >> > sort LoL > >> >> >> > >> >> >> What? Now you claim to know what is taught. It is in TAOPC and it was > >> >> >> taught in the university I taught at. Unlike you, I can't claim to be > >> >> >> an expert in what other universities teach. > >> >> <snip> > >> >> > So i know it wasn't teached and noone i saw used it at university. > >> >> > >> >> How do you know that? > >> > > >> > Well we had one or two algorithm classes, when it come to speed there > >> > was nothing else then quicksort and maybe bucketsort in rare cases. > >> > >> Oh, sorry. You only meant that you weren't taught it? I thought you > >> where making a more general point with "it was never teached to anyone". > >> Anyway, I think you were short-changed by those algorithm courses. > >> There's a lot more to sorting the quicksort and bucket sort. Rest > >> assured that many students are taught about counting sort. In fact it > >> is soften used as as the sort function for the buckets in a bucket sort. > >> > >> -- > >> Ben. > > > >No i tell you noone have ever been taught it... Because it was to simple and to fast, so it would have killed the dinosaurs. > > Everything that could be taught was covered in "one or two algorithm > classes," right? > > We don't need quicksort, bucket sort, heap sort, etc., anymore because > you have overcome the "dinosaurs" by publicizing the counting sort, > right? To be honest Wally i keep bucketsort, it is good when the range is spreadout and the datapoints separated "i like keyed buckets" , all glory to bucketheads. As long you do not make the buckets gravitate to effect eachother.
[toc] | [prev] | [next] | [standalone]
| From | jonas.thornvall@gmail.com |
|---|---|
| Date | 2017-10-30 03:32 -0700 |
| Message-ID | <fe06fb3d-825b-460f-90af-56cc548e63e4@googlegroups.com> |
| In reply to | #34254 |
Den måndag 30 oktober 2017 kl. 10:31:45 UTC+1 skrev Ben Bacarisse: > jonas.thornvall@gmail.com writes: > > > Den söndag 29 oktober 2017 kl. 19:02:08 UTC+1 skrev Ben Bacarisse: > >> jonas.thornvall@gmail.com writes: > >> > >> > Den söndag 29 oktober 2017 kl. 17:18:35 UTC+1 skrev Ben Bacarisse: > >> >> jonas.thornvall@gmail.com writes: > >> >> <snip> > >> >> > You see this is so easy a 10 year old could implement it, and it is > >> >> > way faster but it was never teached to anyone so noone ever used it to > >> >> > sort LoL > >> >> > >> >> What? Now you claim to know what is taught. It is in TAOPC and it was > >> >> taught in the university I taught at. Unlike you, I can't claim to be > >> >> an expert in what other universities teach. > >> <snip> > >> > So i know it wasn't teached and noone i saw used it at university. > >> > >> How do you know that? > > > > Well we had one or two algorithm classes, when it come to speed there > > was nothing else then quicksort and maybe bucketsort in rare cases. > > Oh, sorry. You only meant that you weren't taught it? I thought you > where making a more general point with "it was never teached to anyone". > Anyway, I think you were short-changed by those algorithm courses. > There's a lot more to sorting the quicksort and bucket sort. Rest > assured that many students are taught about counting sort. In fact it > is soften used as as the sort function for the buckets in a bucket sort. > > -- > Ben. I could try do something that sort data not just numbers, but then it would be nice if someone could point me to the fastest implemented algorithm so far. "That is somewhat general purpose for any dataset". So i know where to set the bar.
[toc] | [prev] | [next] | [standalone]
| From | jonas.thornvall@gmail.com |
|---|---|
| Date | 2017-10-30 03:37 -0700 |
| Message-ID | <203a854b-fb5b-40a7-8d9e-eab9f9216945@googlegroups.com> |
| In reply to | #34257 |
Den måndag 30 oktober 2017 kl. 11:32:46 UTC+1 skrev jonas.t...@gmail.com: > Den måndag 30 oktober 2017 kl. 10:31:45 UTC+1 skrev Ben Bacarisse: > > jonas.thornvall@gmail.com writes: > > > > > Den söndag 29 oktober 2017 kl. 19:02:08 UTC+1 skrev Ben Bacarisse: > > >> jonas.thornvall@gmail.com writes: > > >> > > >> > Den söndag 29 oktober 2017 kl. 17:18:35 UTC+1 skrev Ben Bacarisse: > > >> >> jonas.thornvall@gmail.com writes: > > >> >> <snip> > > >> >> > You see this is so easy a 10 year old could implement it, and it is > > >> >> > way faster but it was never teached to anyone so noone ever used it to > > >> >> > sort LoL > > >> >> > > >> >> What? Now you claim to know what is taught. It is in TAOPC and it was > > >> >> taught in the university I taught at. Unlike you, I can't claim to be > > >> >> an expert in what other universities teach. > > >> <snip> > > >> > So i know it wasn't teached and noone i saw used it at university. > > >> > > >> How do you know that? > > > > > > Well we had one or two algorithm classes, when it come to speed there > > > was nothing else then quicksort and maybe bucketsort in rare cases. > > > > Oh, sorry. You only meant that you weren't taught it? I thought you > > where making a more general point with "it was never teached to anyone". > > Anyway, I think you were short-changed by those algorithm courses. > > There's a lot more to sorting the quicksort and bucket sort. Rest > > assured that many students are taught about counting sort. In fact it > > is soften used as as the sort function for the buckets in a bucket sort. > > > > -- > > Ben. > > I could try do something that sort data not just numbers, but then it would be nice if someone could point me to the fastest implemented algorithm so far. "That is somewhat general purpose for any dataset". > > So i know where to set the bar. By implementation i mean in javascript, i do not intend to implement someone else wheel.... I prefer my own.
[toc] | [prev] | [next] | [standalone]
| From | jonas.thornvall@gmail.com |
|---|---|
| Date | 2017-10-29 08:35 -0700 |
| Message-ID | <d4bf3aae-8aa4-48cb-a9d0-13cc89162f62@googlegroups.com> |
| In reply to | #34236 |
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. > > I think you should speak to someone you trust about these thoughts. > It's not normal for someone starting out in a field to believe they have > invented significant things hitherto not spotted by "the dinosaurs" but > which, nonetheless, go unappreciated. > > <snip> > -- > Ben. http://www.cs.cmu.edu/~adityaa/211/Lecture12AG.pdf
[toc] | [prev] | [next] | [standalone]
| From | jonas.thornvall@gmail.com |
|---|---|
| Date | 2017-10-29 06:07 -0700 |
| Message-ID | <27cc47e1-2ed9-4e79-84e8-923454a7cff5@googlegroups.com> |
| In reply to | #34230 |
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. > > > But usual there is some weird aspect i can't find out what i do wrong, > > if you set startrange for the random numbergererator higher then 0 > > values will turn up undefined i don't get it. > > You don't zero the right number of elements in countval. This, in turn, > is because you do > > number=Math.floor(Math.random() * end) + start; > > so the numbers range from start to start+end-1. > > > But the timings are correct, 5 times faster for 100k of integers, and > > best of all the algorithm is linear, but it purely for sorting > > numbers. > > Quoting a factor is not very helpful. It's likely that you are doing > some form of counting sort, so you can make it any number of times > faster simply by sorting a larger set. Equally, you can probably make > it lower by choosing a small set with a huge range. > > -- > Ben. Can you understand the bug that occur when the sample range start is not zero Ben? I tried to figure it out but i just do not seem to find why and where it occur, i suspect it occur when the values written to the array somehow, but i really do not get it.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2017-10-29 14:37 +0000 |
| Message-ID | <87tvyit3z2.fsf@bsb.me.uk> |
| In reply to | #34233 |
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: <snip> >> > But usual there is some weird aspect i can't find out what i do wrong, >> > if you set startrange for the random numbergererator higher then 0 >> > values will turn up undefined i don't get it. >> >> You don't zero the right number of elements in countval. This, in turn, >> is because you do >> >> number=Math.floor(Math.random() * end) + start; >> >> so the numbers range from start to start+end-1. <snip> > Can you understand the bug that occur when the sample range start is > not zero Ben? Yes. What did you not understand in the explanation? (Please try trimming quoted material in your posts.) <snip> -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | jonas.thornvall@gmail.com |
|---|---|
| Date | 2017-10-29 06:23 -0700 |
| Message-ID | <e577e87c-3ed9-47f8-a5a6-0262ef58409c@googlegroups.com> |
| In reply to | #34230 |
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. > > > But usual there is some weird aspect i can't find out what i do wrong, > > if you set startrange for the random numbergererator higher then 0 > > values will turn up undefined i don't get it. > > You don't zero the right number of elements in countval. This, in turn, > is because you do > > number=Math.floor(Math.random() * end) + start; > > so the numbers range from start to start+end-1. > > > But the timings are correct, 5 times faster for 100k of integers, and > > best of all the algorithm is linear, but it purely for sorting > > numbers. > > Quoting a factor is not very helpful. It's likely that you are doing > some form of counting sort, so you can make it any number of times > faster simply by sorting a larger set. Equally, you can probably make > it lower by choosing a small set with a huge range. > > -- > Ben. Well i can agree it is funny "although albeit a bit worrying" when the strawmans approaches tend to be so much faster then the experts LoL
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2017-10-29 14:50 +0000 |
| Message-ID | <87ineyt3ce.fsf@bsb.me.uk> |
| In reply to | #34234 |
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 i can agree it is funny "although albeit a bit worrying" when the > strawmans approaches tend to be so much faster then the experts LoL Who are you agreeing with? Did someone say it was funny. If you don't know what the experts know, of course you might think it's something new. That's not worrying for the experts. -- Ben.
[toc] | [prev] | [standalone]
Page 2 of 2 — ← Prev page 1 [2]
Back to top | Article view | comp.lang.javascript
csiph-web