in reply to Re: A short meditation about hash search performance
in thread A short meditation about hash search performance
Well, if you can't do queries in O(1) time, you can't do
deletes in O(1) time (because to delete something, you first
need to find it), and you can only do inserts in O(1) if
you accept duplicates - which Perl hashes don't.
Abigail
|
---|
Replies are listed 'Best First'. | |
---|---|
Re: Re: A short meditation about hash search performance
by Anonymous Monk on Nov 16, 2003 at 05:19 UTC | |
by Abigail-II (Bishop) on Nov 16, 2003 at 22:15 UTC | |
by Schemer (Scribe) on Nov 16, 2003 at 08:03 UTC |
In Section
Meditations