[lug] parsing between two lists

Tkil tkil at scrye.com
Thu Mar 28 15:29:50 MST 2002


>>>>> "Rob" == Rob Nagler <nagler at bivio.biz> writes:

Rob> I am writing this from a workstation which cost $1000 and has
Rob> 512MB.  I think it is a historical anachronism to assume that the
Rob> hash is too big for the vast majority of boxes out there.

ha.  :)  sorry if it looked like i was trying to get your goat (camel?).

your point is taken, but there are still places where the difference
between O(N) and O(1) memory usage will be relevant.  in this case?
almost certainly not -- if we're still dealing with software packages,
we're looking at N on the order of 1000.  i can easily think of
problems where N is on the order of 1e9 (worldwide census data,
documents in google, hamburgers from macdonalds).

either way, we've used up enough e-mail time to have done the
comparison by hand.  :)

t.



More information about the LUG mailing list