Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re: Re: sort with fewest moves (Bose-Nelson algorithm)

by axelrose (Scribe)
on Feb 11, 2002 at 19:38 UTC ( #144680=note: print w/replies, xml ) Need Help??


in reply to Re: sort with fewest moves (Bose-Nelson algorithm)
in thread sort with fewest moves

Many thanks to you and all the others for the many and sound responses!

After all I understand that I should have named it "minimal move algorithm"

I need some time to digest all of this. For the moment I'll leave the monastery for the German Perl workshop which starts tomorrow evening:)
Cheers, Axel.

  • Comment on Re: Re: sort with fewest moves (Bose-Nelson algorithm)

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://144680]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (8)
As of 2020-03-30 20:18 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    To "Disagree to disagree" means to:









    Results (176 votes). Check out past polls.

    Notices?