Paul Eggert <egg...@cs.ucla.edu> writes: > Come to think of it, looking at gnulib memxfrm gave me an idea > to improve the performance of GNU sort by bypassing the need for an > memxfrm-like function entirely. I pushed a patch to do that at > <http://git.savannah.gnu.org/gitweb/?p=coreutils.git;a=commitdiff;h=2b49b140cc13cf36ec5ee5acaca5ac7bfeed6366>.
I don't know this code at all, but would your approach lead to problems if two different strings have the same MD5 hash? MD5 is broken, and finding collisions takes just seconds on normal PC. See: http://en.wikipedia.org/wiki/MD5#Security /Simon
