adjustable array vs hash-table
- From: Slobodan Blazeski <slobodan.blazeski@xxxxxxxxx>
- Date: Wed, 30 Jan 2008 14:09:11 -0800 (PST)
I could use a hash-table or an adjustable array. Considering the keys
of the hash-table are equal to indices in the array 0.1.2.3.4...
functionality is the same. So which one is more efficient at
a. Expanding when new elements are added when container can't hold
them
b. Accessing elements via index / key.
thanks
Slobodan
.
- Follow-Ups:
- Re: adjustable array vs hash-table
- From: Joost Diepenmaat
- Re: adjustable array vs hash-table
- From: vanekl
- Re: adjustable array vs hash-table
- From: Xah Lee
- Re: adjustable array vs hash-table
- From: Pascal Costanza
- Re: adjustable array vs hash-table
- Prev by Date: Re: Paul Graham's Arc is released today... what is the long term impact?
- Next by Date: Re: adjustable array vs hash-table
- Previous by thread: When is it good to use #+implementation ?
- Next by thread: Re: adjustable array vs hash-table
- Index(es):
Relevant Pages
|
|