On Monday 30 May 2005 23:02, Frederik Eaton wrote: > I hope that you aren't proposing an algorithm which is similar to > card-shuffling. That would be exactly like merge-sorting on a key hash > - i.e. no more efficient.
Agreed! The algorithm implemented is a slight variation on Knuth's shuffle algorithm--instead of randomizing a list into another list, we randomize directly to output--and is linear O(n). Thanks, Davis _______________________________________________ Bug-coreutils mailing list Bug-coreutils@gnu.org http://lists.gnu.org/mailman/listinfo/bug-coreutils
