Sciweavers

63
Voted
ICALP
1999
Springer
15 years 1 months ago
Average-Case Complexity of Shellsort
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 avera...
Tao Jiang, Ming Li, Paul M. B. Vitányi