• Advertisement
Sign in to follow this  

Pessimal Algorithms and Simplexity Analysis

This topic is 4009 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

Advertisement
Hasn't Microsoft been using these ideas for decades? :P

And:

Quote:

For practical applications, it is obvious that slowsort is the eminently suitable algorithm whenever your boss sends you to sort something in Paris. Among other nice properties, during the execution of slowsort the number of inversions in A is nonincreasing. So, in a certain sense (if you are in Paris, all expenses
paid, this sense is clear) slowsort never makes a wrong move.


Ah ha! :)

Share this post


Link to post
Share on other sites
Brilliant!

"...a perfect illustration of the multiply and surrender paradigm"

Share this post


Link to post
Share on other sites
Thank you very much! That's clearly been around for a while, but I never saw it before. Excellent material. Let's all start using it as reference when answering Beginner's questions. =)

Share this post


Link to post
Share on other sites
Sign in to follow this  

  • Advertisement