Message74834
Well, perhaps the deque documentation should make it clear that random
access is O(n), rather than O(1) for a list. With this information it is
easy to infer that operations such as shuffle() can be much slower on a
deque. |
|
Date |
User |
Action |
Args |
2008-10-16 12:43:17 | pitrou | set | recipients:
+ pitrou, loewis, georg.brandl, phr |
2008-10-16 12:43:17 | pitrou | set | messageid: <1224160997.13.0.00641954678318.issue4123@psf.upfronthosting.co.za> |
2008-10-16 12:43:13 | pitrou | link | issue4123 messages |
2008-10-16 12:43:12 | pitrou | create | |
|