On 8/31/2013 9:42 AM, Blaicher, Christopher Y. wrote:
Consider that a fast card sorter could process about 2,000 cards a minute, or even if it could process 20,000 cards a minute, that works out to about 2,666 bytes a second for the 2,000 card case or 26,666 bytes a second for the fictional 20,000 card case.
It's worse than that, since the sorter requires either one (numeric only) or two (alphanumeric) passes per sort column. Luckily my only use was confined to short numeric fields <g> Gerhard Postpischil Bradford, Vermont
