Sign in to follow this  
Telamon

Pessimal Algorithms and Simplexity Analysis

Recommended Posts

JuNC    236
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
osmanb    2082
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

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now

Sign in to follow this