About hash table lookup. In theory, if you have infinite ammount of memory, you can approach O(1) time. As I understand all really implemented hash algorithms with finite memory will take, strictly speaking, O(n) time. There is an example of unsuccessful order of data that will make Perl's implementation of hashes to take O(n) for searching. In practice you'll hardly will be much worse than O(1).

In reply to RE: Shift, Pop, Unshift and Push with Impunity! by Anonymous Monk
in thread Shift, Pop, Unshift and Push with Impunity! by lhoward

Title:
Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post; it's "PerlMonks-approved HTML":