Science-advisor
REGISTER info/FAQ
Login
username
password
     
forgot password?
register here
 
Research articles
  search articles
  reviews guidelines
  reviews
  articles index
My Pages
my alerts
  my messages
  my reviews
  my favorites
 
 
Stat
Members: 2981
Articles: 2'033'011
Articles rated: 2577

25 January 2021
 
  » arxiv » cs.CC/9906008

 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
AffiliationMcMaster U.), Ming Li (U. Waterloo), Paul Vitanyi (CWI & U. Amsterdam
AbstractWe 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   
 
Visitor rating: did you like this article? no 1   2   3   4   5   yes

No review found.
 Did you like this article?

This article or document is ...
important:
of broad interest:
readable:
new:
correct:
Global appreciation:

  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 CCBot/2.0 (https://commoncrawl.org/faq/)






ScienXe.org
» my Online CV
» Free


News, job offers and information for researchers and scientists:
home  |  contact  |  terms of use  |  sitemap
Copyright © 2005-2021 - Scimetrica