Bounds on algorithms for string generation |
| |
Authors: | A. C. McKellar C. K. Wong |
| |
Affiliation: | (1) IBM Thomas J.Watson Research Center, P.O. Box 218, 10598 Yorktown Heights, N.Y., USA |
| |
Abstract: | Summary The well-known lower bound of log2n! on the number of comparisons required to sort n items is extended to cover algorithms, such as replacement selection, which produce a sorted string whose length is a random variable. The case of algorithms which produce several strings is also discussed and these results are then applied to obtain an upper bound on the length of strings produced by a class of string generation algorithms.The authors would like to thank Professor R. Floyd for a stimulating discussion at an early stage in this work. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|