Rajiv Ramaswami, Kumar N. Sivarajan
IEEE/ACM Transactions on Networking
Paper
Sorting by Natural Selection
Abstract
A amily of sorting algorithms is proposed, the members of which make Adler use of the memory space and thus yield longer sorted strings. Extensive simulation results are presented, and various implications and lurther application, are discussed. © 1972, ACM. All rights reserved.
Related
Preeti Malakar, Thomas George, et al.
SC 2012
S. Sattanathan, N.C. Narendra, et al.
CONTEXT 2005
Robert C. Durbeck
IEEE TACON