Beefy Boxes and Bandwidth Generously Provided by pair Networks
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

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 rifling through the Monastery: (5)
As of 2015-07-03 23:44 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (57 votes), past polls