| | |
| | |
Stat |
Members: 3643 Articles: 2'487'895 Articles rated: 2609
28 March 2024 |
|
| | | |
|
Article overview
| |
|
Average-Case Complexity of Shellsort (Preliminary version) | Tao Jiang
; Ming Li
; Paul Vitanyi
; | Date: |
4 Jun 1999 | Subject: | Computational Complexity; Data Structures and Algorithms ACM-class: F.2.2, E.1 | cs.CC cs.DS | Affiliation: | McMaster U.), Ming Li (U. Waterloo), Paul Vitanyi (CWI & U. Amsterdam | Abstract: | We prove a general lower bound on the average-case complexity of Shellsort: the average number of data-movements (and comparisons) made by a $p$-pass Shellsort for any incremental sequence is $Omega (pn^{1 + 1/p})$ for every $p$. The proof method is an incompressibility argument based on Kolmogorov complexity. Using similar techniques, the average-case complexity of several other sorting algorithms is analyzed. | Source: | arXiv, cs.CC/9906008 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |