On Sun, Mar 9, 2014 at 2:32 PM, Marko Rauhamaa <[email protected]> wrote: > Dan Stromberg <[email protected]>: > >> This is not just a detail: O(1) tends to be beat O(logn) pretty easily >> for large n. > > There is no O(1) hash table.
http://stackoverflow.com/questions/2771368/can-hash-tables-really-be-o1 -- https://mail.python.org/mailman/listinfo/python-list
