RetroSearch Browse

Wed Nov 4 02:00:12 CET 2009 · http://mail.python.org/pipermail/python-dev/2009-November/093690.html

Antoine Pitrou wrote:
> Guido van Rossum <guido <at> python.org> writes:
> 
>>Picking a random element can be done in O(1) only if the data
>>structure supports access by index, which Python's hash tables don't.
> 
> Well, at the implementation level, they can. You'd just have to pick a new
> random index until it points to a non-empty slot.

But that's hardly O(1).

-- 
Greg

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from http://mail.python.org/pipermail/python-dev/2009-November/093690.html below:

[Python-Dev] Retrieve an arbitrary element from a set withoutremoving it