Re: data structure question



Jack wrote:
Richard Heathfield wrote:
Jack said:

What is the best data structure for designing a telephone directory
which contains several millions items? WHat is spped of lookup? Thanks.

What do your lecture notes suggest?

Is hashing table the correct answer? Thanks.

It's fine if you need only to look up individual numbers. It's not
fine if you need to print an alphabetical phone book.

.



Relevant Pages

  • Re: data structure question
    ... Richard Heathfield wrote: ... WHat is spped of lookup? ... What do your lecture notes suggest? ... Is hashing table the correct answer? ...
    (comp.programming)
  • Re: data structure question
    ... Richard Heathfield wrote: ... WHat is spped of lookup? ... What do your lecture notes suggest? ... Is hashing table the correct answer? ...
    (comp.programming)
  • Re: compile time vs. run time?
    ... lookup table and iteration as part of the same solution. ... Iteration is no better than if-else clauses in terms of performance. ... secondary storage, pre-hashing key values, etc. ... > faster than hashing. ...
    (comp.lang.cpp)
  • Re: record lookup
    ... call a sub in the afterUpdate event of cboLandId that changes rowsource ... Jack de Visser wrote: ... field land-id is a lookup on table 1. ...
    (comp.databases.ms-access)
  • Re: PE Dumper
    ... > I also need the source to enable me to access the Import Lookup Table in ... > idata section. ...
    (microsoft.public.win32.programmer.kernel)