ALBERT — All Library Books, journals and Electronic Records Telegrafenberg

Hits per page

hit 1 - 1 | 1 hit

Sorting

Electronic Resource

Bounds on algorithms for string generation (1972)

McKellar, A. C. ; Wong, C. K.

Springer

Acta informatica 1 (1972), S. 311-319

add to mindlist on the mindlist

Details

ISSN: 1432-0525

Source: Springer Online Journal Archives 1860-2000

Topics: Computer Science

Notes: Summary The well-known lower bound of log2 n! 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.

Type of Medium: Electronic Resource

URL: http://dx.doi.org/10.1007/BF00289511

Permalink

	Location	Call Number	Expected	Availability

Others were also interested in ...

Paper (German National Licenses)

Fulltext

hit 1 - 1 | 1 hit