Abstract
We demonstrate an Ω(pn1+1/p) lower bound on the average-case running time (uniform distribution) of p-pass Shellsort. This is the first nontrivial general lower bound for average-case Shellsort. © 2000 ACM.
Author supplied keywords
Cite
CITATION STYLE
APA
Jiang, T., Ming, L. I., & Vitányi, P. (2000). A lower bound on the average-case complexity of shellsort. Journal of the ACM, 47(5), 905–911. https://doi.org/10.1145/355483.355488
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free