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