Beefy Boxes and Bandwidth Generously Provided by pair Networks Cowboy Neal with Hat
Just another Perl shrine
 
PerlMonks  

Re: Re: Re: A short meditation about hash search performance

by Schemer (Scribe)
on Nov 16, 2003 at 08:03 UTC ( #307442=note: print w/ replies, xml ) Need Help??


in reply to Re: Re: A short meditation about hash search performance
in thread A short meditation about hash search performance

Deletion of an element x can be accomplished in O(1) time if the lists are doubly linked.

It still means you need to find an object before you can delete it.


Comment on Re: Re: Re: A short meditation about hash search performance

In Section Meditations

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://307442]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (19)
As of 2013-05-21 20:37 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The best material for plates (tableware) is:









    Results (446 votes), past polls