Pessimal Algorithms and Simplexity Analysis
Author
I have a new favorite algorithms paper that I thought might be of general interest. My apologies to any who have seen this before.
Pessimal Algorithms and Simplexity Analysis
Hasn't Microsoft been using these ideas for decades? :P
And:
Ah ha! :)
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! :)
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. =)
This topic is closed to new replies.
Advertisement
Popular Topics
Advertisement
