Israel Cidon, Leonidas Georgiadis, et al.
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
Rolf Clauberg
IBM J. Res. Dev
G. Ramalingam
Theoretical Computer Science
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014