If in the following situation, =========== file1 has numbers from 1 to 200000, 200000 lines file2 has several lines(about 200 ~300lines) of random numbers in the range of 1-200000 ===========
The time cost for finishing the following command could be over 15 minutes on linux -- a little huge. $ grep -v -f file1 file2 (FYI, on AIX it could only be less than 1 second) Maybe there is also a room for optimization not only on the memory usage but also on the time cost. -- Junkui Quan (JQK) www.redhat.com
signature.asc
Description: OpenPGP digital signature