Re: adjustable array vs hash-table
- From: Slobodan Blazeski <slobodan.blazeski@xxxxxxxxx>
- Date: Wed, 30 Jan 2008 15:27:05 -0800 (PST)
In the ideal world computers would be so fast that we could do all our
programming with god given single linked list. But considering the
world is less than ideal and there's a huge difference between
program that answers within seconds and those that needs hours to
compute we have to step down from our pedestal and get our hands dirty
with optimized structures for certain job.
Maybe someday compilers will be so smart to create highly optimized
code by themselves but that day is not today. Mother nature might have
an enourmous time and/or processing power but we're just mortals, we
have to be practical in order to survive. I always start my coding
with plain simple lists, and move to specialized data structures only
if I must to. If a high level languages don't give me any choice my
hands would be bound. So I have to either live with slow code or code
in other language.
cheers
Slobodan
In theory, there is no difference between theory and practice. But, in
practice, there is.
-Jan L. A. van de Snepscheut
.
- Follow-Ups:
- is it true that hash-tables increase their capacity to the next prime number?
- From: Slobodan Blazeski
- is it true that hash-tables increase their capacity to the next prime number?
- References:
- adjustable array vs hash-table
- From: Slobodan Blazeski
- Re: adjustable array vs hash-table
- From: Xah Lee
- adjustable array vs hash-table
- Prev by Date: Re: adjustable array vs hash-table
- Next by Date: is it true that hash-tables increase their capacity to the next prime number?
- Previous by thread: Re: adjustable array vs hash-table
- Next by thread: is it true that hash-tables increase their capacity to the next prime number?
- Index(es):
Relevant Pages
|