[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
break even point between hash tables and lists
- To: clisp-list@ma2s2.mathematik.uni-karlsruhe.de
- Subject: break even point between hash tables and lists
- From: dxs@evolving.com (Dan Stanger)
- Date: Fri, 4 Mar 1994 14:37:52 -0700
what is the number of elements that causes hash tables to be more
efficient than a list for storing and retrieving data? also has anybody
tried using a sorted array and binary search? i am interested in
this information if anybody has this.
thanks,
dan stanger