On Sun, Mar 03, 2002 at 01:13:32PM -0500, Michael G Schwern wrote: > PS With a truly lazy sort you'd be able to do... > > ($first) = sort { $a wibble $b } @big_list; # in O(n) time.
Not necessarely - it would depend on the underlaying sorting mechanism. Shell sort and heap sort for instance don't get the first element first. Abigail