Univrsity of Amsterdam

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
We prove a lower bound expressed in the increment sequence on the average-case complexity (number of inversions which is proportional to the running time) of Shellsort. This lower bound is sharp in every case where it could be checked. We obtain new results e.g. determining the average-case complexity precisely in the Yao-Janson-Knuth 3-pass case.
  • 1