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?
to your account
O(log n) time seems odd for any sort algorithm. Wikipedia lists shell sort's best case as O(n log n):
The text was updated successfully, but these errors were encountered:
Hi @murraycu, so sorry for the huge delay on this one. You are totally right, it should be fixed now :).
Thanks so much!
Successfully merging a pull request may close this issue.