Sorting by Natural Selection

A family of sorting algorithms is proposed,
the members of which make fuller use of the memory 
space and thus yield longer sorted strings.  Extensive
simulation results are presented, and various 
implications and further applications are discussed.

CACM October, 1972

Frazer, W. D.
Wong, C. K.

algorithms, sorting by replacement selection, expected string length

5.31

CA721006 JB January 27, 1978  2:54 PM

1638	4	2272
1867	4	2272
2176	4	2272
2272	4	2272
2272	4	2272
1638	5	2272
2272	5	2272
2272	5	2272
2272	5	2272
677	5	2272