New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

shell sort's best case time looks wrong: O(log n) #3

murraycu opened this Issue Feb 15, 2016 · 1 comment


None yet
2 participants

murraycu commented Feb 15, 2016

O(log n) time seems odd for any sort algorithm. Wikipedia lists shell sort's best case as O(n log n):


This comment has been minimized.


josem commented May 31, 2016

Hi @murraycu, so sorry for the huge delay on this one. You are totally right, it should be fixed now :).

Thanks so much!

@josem josem closed this May 31, 2016

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment