Re: "lsort -unique" and maintaining ORDER
- From: Bryan Oakley <oakley@xxxxxxxxxxxxxxxxxxxx>
- Date: Tue, 16 Aug 2005 21:38:35 GMT
I missed the part about lists being 10,000 elements long. You'd
definitely be better off writing this in C. lsort by itself takes a
long time on a list of 10,000 unique elements.
That all depends on your definition of "long time". lsort can sort 10000 items in well under a second. On my slowish laptop I can sort 10000 unique numbers in about 66 ms. That's not terribly long in the grand scheme of things (unless you're doing it in a loop several thousand times)