Search: onr:"swepub:oai:DiVA.org:uu-26996" >
Shellsort with thre...
Shellsort with three increments
-
- Janson, S (author)
- Uppsala universitet
-
- Knuth, DE (author)
- Uppsala universitet
-
(creator_code:org_t)
- JOHN WILEY & SONS LTD, 1997
- 1997
- English.
-
In: RANDOM STRUCTURES & ALGORITHMS. - : JOHN WILEY & SONS LTD. ; 10:1-2, s. 125-142
- Related links:
-
https://urn.kb.se/re...
Abstract
Subject headings
Close
- A perturbation technique can be used to simplify and sharpen A. C. Yao's theorems about the behavior of shellsort with increments (h,g,1). In particular, when h = Theta(n(7/15)) and g = Theta(h(1/5)), the running time is O(n(23/15)). The proof involves in
Publication and Content Type
- vet (subject category)
- art (subject category)
Find in a library
To the university's database