re:hash & balanced trees

Date: Tue, 1 Jul 1997 00:15:03 -0400
From:
Richard Godard <janus@cam.org>
Content-Type: text/plain; charset="us-ascii"
In-Reply-To: <Pine.SOL.3.91.970630232249.2273C-100000@atl1>
References: <9707010118.AA01082@kilpikonna.media.mit.edu>

>Balanced binary trees are O(log(n)) on searches, and algortithms such as AVL
>trees have acceptable insertion and deletion measures.  Besides, there is c
>source code available.

That's fine for mutable data type... but unless I'm mistaken MOO lists are not.

Beside be carefull with the O() there are some constants that disapears and
they can't always be neglected... beside in theory hash table have O(1)
search/delete/add/etc., in practice... :) :) :)

Welcome to the marvelous world of data structures and algorithms :)

Richard

Follow-Ups:

re:hash & balanced trees

From: Charles Victor Bancroft <bancroft@america.net>

re:hash & balanced trees

From: Michael Brundage <brundage@piaf.ipac.caltech.edu>

References:

Re: my kingdom for a hash table!

From: Amy Bruckman <asb@media.mit.edu>

re:hash & balanced trees

From: Charles Victor Bancroft <bancroft@america.net>

Prev by Subject: re:hash & balanced trees
Next by Subject: re:hash & balanced trees
Prev by thread: re:hash & balanced trees
Next by thread: re:hash & balanced trees
Index(es):
- Subject
- Thread

Home | Subject Index | Thread Index