๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Best case lower bounds for Heapsort

โœ Scribed by Y. Ding; M. A. Weiss

Publisher
Springer Vienna
Year
1992
Tongue
English
Weight
537 KB
Volume
49
Category
Article
ISSN
0010-485X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the Best Case of Heapsort
On the Best Case of Heapsort
โœ B. Bollobรกs; T.I. Fenner; A.M. Frieze ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 169 KB

Although discovered some 30 years ago, the Heapsort algorithm is still not completely understood. Here we investigate the best case of Heapsort. Contrary to ลฝ . claims made by some authors that its time complexity is O n , i.e., linear in the ลฝ . number of items, we prove that it is actually O n log

Lower bounds for lower Ramsey numbers
Lower bounds for lower Ramsey numbers
โœ Ralph Faudree; Ronald J. Gould; Michael S. Jacobson; Linda Lesniak ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 310 KB ๐Ÿ‘ 1 views

## Abstract For any graph __G__, let __i__(__G__) and ฮผ;(__G__) denote the smallest number of vertices in a maximal independent set and maximal clique, respectively. For positive integers __m__ and __n__, the lower Ramsey number __s__(__m, n__) is the largest integer __p__ so that every graph of or

Lower Bounds for Shellsort
Lower Bounds for Shellsort
โœ C.Greg Plaxton; Torsten Suel ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 226 KB

We show lower bounds on the worst-case complexity of Shellsort. In particular, ลฝ ลฝ 2 . ลฝ . 2 . we give a fairly simple proof of an โ€ n lg n r lg lg n lower bound for the size of Shellsort sorting networks for arbitrary increment sequences. We also show an identical lower bound for the running time o