Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things
 
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?
[LanX]: White House indicates it could find funds to train 1 million teachers ...
[LanX]: ...no wait
[LanX]: White House indicates it could find funds to train and arm 1 million teachers!
LanX relieved...

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (8)
As of 2018-02-23 11:26 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    When it is dark outside I am happiest to see ...














    Results (301 votes). Check out past polls.

    Notices?