Balanced trees

Marko Rauhamaa marko at pacujo.net
Sun Mar 9 22:32:54 CET 2014


Dan Stromberg <drsalists at gmail.com>:

> 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.


Marko



More information about the Python-list mailing list