Re: avl-trees vs. hashes

[Keith Wright <kwright@tiac.net>]

> cc: guile@cygnus.com
> From: Maciej Stachowiak <mstachow@mit.edu>
> kwright@tiac.net writes:
> > Sorry, both wrong.  The hash table operations appear to be O(1)
> > as long as the number of entries (n) is less than the size
> > you initially allocated for the table.
> 
> Your analysis is incorrect.

Indeed it is.  No need for any more people to point that out.
I wonder if I can sue for a tuition refund by arguing in court
that I graduated as a complete ignoramus.

> Experience shows that pedantic theory discussions are considered
> on-topic on this list. :-)

Pedantic is no problem, but wrong is embarrassing.
Also sorry about the double posting, if I made one (not sure).

-- 
     --Keith

This mail message sent by GNU emacs and Linux.
Food, Shelter, Source code.