Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I have an array of values which is almost, but not quite sorted, with a few values displaced (say, 50 in 100000). How to sort it most efficiently? (performance is absolutely crucial here and should be way faster than O(N)).
I know about smoothsort, but I can’t find Java implementation. Does anyone know whether it is already implemented? Or what I can use for this task instead of smoothsort?
Actually, the Wikipedia contains a Java implementation of smoothsort. You can find it here:
http://en.wikipedia.org/wiki/Smoothsort.