[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: break even point between hash tables and lists
- To: firstname.lastname@example.org
- Subject: Re: break even point between hash tables and lists
- From: haible (Bruno Haible)
- Date: Mon, 7 Mar 94 15:30:43 +0100
Dan Stanger <email@example.com> asks:
> what is the number of elements that causes hash tables to be more
> efficient than a list for storing and retrieving data?
There was a discussion about this in comp.lang.lisp a couple of months ago.
For speed, the break-even point (comparing ASSOC to GETHASH) depends much
on the Lisp implementation: for some implementations it is about 200 elements,
for CLISP it is 2 or 3 elements. For space, however: lists are always more