Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math.independent

Topic: Just finished the fastest ever, general purpose sorting algorithm.
Replies: 29   Last Post: Jan 8, 2013 10:21 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
forbisgaryg@gmail.com

Posts: 43
Registered: 11/26/12
Re: Just finished the fastest ever, general purpose sorting algorithm.
Posted: Jan 6, 2013 9:56 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

On Sunday, January 6, 2013 6:18:16 PM UTC-8, JT wrote:
> On 7 Jan, 02:49, forbisga...@gmail.com wrote:
>

> > On Sunday, January 6, 2013 9:53:53 AM UTC-8, JT wrote:
>
> > > It is not java it is JS if you can not manage copy paste the text into
>
> > > a txt document, rename extension .html, doubleclick and press the
>
> > > button to sort i am afraid you are beyond help.
>
> >
>
> > What weight would you assign to the word "irrational"?  If you
>
> > assign it to the same weight as "irrationals" then how do you
>
> > differentiate between the two words?  If the index is in the
>
> > range 256^11 so that each word up to 11 characters is assigned
>
> > a unique weight then your output loop is going to take some time
>
> > and will be quite uproductive for a page of text or even some
>
> > 2000 words.
>
>
>
> I've just told you that the pointer implementation of countsort do not
>
> need to allocate memory, and that it is recursive working and run each
>
> digit length in their bransch. That should be enough to implement it.


But your code is:

valdist="";
for (j=0;j<256;j++){
temp2=countval[j]
for (k=0;k<temp2;k++){
valdist=valdist+j+",";
}

Where does that 256 come in? You're reporting out by
spinning through all of the indicies even those with
no instances. A sparse table would waste time spinning
through the entries, reporting nothing. While there are
associative memories that will handle arbitrary indicies
they are quite expensive and don't really help you in the
way you might think.


Date Subject Author
1/5/13
Read Just finished the fastest ever, general purpose sorting algorithm.
JT
1/5/13
Read Re: Just finished the fastest ever, general purpose sorting algorithm.
David Bernier
1/5/13
Read Re: Just finished the fastest ever, general purpose sorting algorithm.
JT
1/5/13
Read Re: Just finished the fastest ever, general purpose sorting algorithm.
forbisgaryg@gmail.com
1/5/13
Read Re: Just finished the fastest ever, general purpose sorting algorithm.
JT
1/5/13
Read Re: Just finished the fastest ever, general purpose sorting algorithm.
Scott Berg
1/5/13
Read Re: Just finished the fastest ever, general purpose sorting algorithm.
JT
1/5/13
Read Re: Just finished the fastest ever, general purpose sorting algorithm.
forbisgaryg@gmail.com
1/6/13
Read Re: Just finished the fastest ever, general purpose sorting algorithm.
JT
1/6/13
Read Re: Just finished the fastest ever, general purpose sorting algorithm.
JT
1/6/13
Read Re: Just finished the fastest ever, general purpose sorting algorithm.
forbisgaryg@gmail.com
1/6/13
Read Re: Just finished the fastest ever, general purpose sorting algorithm.
JT
1/6/13
Read Re: Just finished the fastest ever, general purpose sorting algorithm.
forbisgaryg@gmail.com
1/6/13
Read Re: Just finished the fastest ever, general purpose sorting algorithm.
JT
1/6/13
Read Re: Just finished the fastest ever, general purpose sorting algorithm.
JT
1/7/13
Read Re: Just finished the fastest ever, general purpose sorting algorithm.
forbisgaryg@gmail.com
1/7/13
Read Re: Just finished the fastest ever, general purpose sorting algorithm.
JT
1/7/13
Read Re: Just finished the fastest ever, general purpose sorting algorithm.
forbisgaryg@gmail.com
1/7/13
Read Re: Just finished the fastest ever, general purpose sorting algorithm.
JT
1/7/13
Read Re: Just finished the fastest ever, general purpose sorting algorithm.
JT
1/7/13
Read Re: Just finished the fastest ever, general purpose sorting algorithm.
JT
1/7/13
Read Re: Just finished the fastest ever, general purpose sorting algorithm.
JT
1/7/13
Read Re: Just finished the fastest ever, general purpose sorting algorithm.
JT
1/8/13
Read Re: Just finished the fastest ever, general purpose sorting algorithm.
kiru.sengal@gmail.com
1/8/13
Read Re: Just finished the fastest ever, general purpose sorting algorithm.
forbisgaryg@gmail.com
1/5/13
Read Re: Just finished the fastest ever, general purpose sorting algorithm.
JT
1/6/13
Read Re: Just finished the fastest ever, general purpose sorting algorithm.
UpChunky
1/6/13
Read Re: Just finished the fastest ever, general purpose sorting algorithm.
JT
1/6/13
Read Re: Just finished the fastest ever, general purpose sorting algorithm.
JT
1/5/13
Read Re: Just finished the fastest ever, general purpose sorting algorithm.
JT

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.