Sorting by natural selection
暂无分享,去创建一个
(.oPlm*Sq~ @ 1972 Ass,:~:iaIion for Compa~isg .Ma~:hinery, Inc. Ge~efal ~:~e~missioa to republish, 5e~ ne~ for prot}L al{ or par1 of ~his materia~ g N~am~J, grr(B,'ided tha~ refe:re~vce >~ made to gNs pab[ica.tion~ ~o i~co; da~.e .of ~LSsue, and to ghe faac2 ~ha[ refx"~nting prM~eges v4ere ga~ed b:, ~yer:mixs~o~ of ~he A:¢~x~ation for Corn putiBg Maehiner).z A.ughofs' ad@ess~ IBM Thomas J, Watson Re:>:arch (/ester, P~O. ~:~:~ 218, Yc~rk~own kkighet. NY 10598~
[1] B. T. Bennett,et al. Approximating Optimal Direct-Access Merge Performance , 1971, IFIP Congress.
[2] Edward H. Friend,et al. Sorting on Electronic Computer Systems , 1956, JACM.
[3] Donald E. Knuth. Length of strings for a merge sort , 1963, CACM.
[4] Betty Jane Gassner. Sorting by replacement selecting , 1967, CACM.