On Wed, Nov 10, 2004 at 11:13:33PM -0500, Uri Guttman wrote: > but here is another thought based on the old disk sort/merges and > such. you can transpose sections of the input matrix and then join/merge > those.
When I first read Knuth's TAOCP books, in my irreverent youth, I discounted some of the old limited space algorithms on the grounds that computers are much faster and have more storage. I have since realized that we also have more data *and* those algorithms do contain some very nice gems that are still useful. If only someone could collect them and show their usefulness in a modern context ... -Gyepi _______________________________________________ Boston-pm mailing list [EMAIL PROTECTED] http://mail.pm.org/mailman/listinfo/boston-pm
