On Thu, Apr 4, 2013 at 12:25 AM, Roy Smith <r...@panix.com> wrote: > > Fair enough. In fact, given that reading the file from disk is O(n) and > sorting it is O(n log n), at some point, the sort will totally swamp the > input time.
But given the much larger fixed cost of disk access, that might take an awful lot of strings... ChrisA -- http://mail.python.org/mailman/listinfo/python-list
