sturlamolden sturlamolden at yahoo.no
Sat Mar 22 09:43:33 EDT 2008

• Previous message (by thread): finding items that occur more than once in a list
• Next message (by thread): finding items that occur more than once in a list
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

---

On 22 Mar, 09:31, Bryan Olson <fakeaddr... at nowhere.org> wrote:

> Even a hash function that behaves as a random oracle has
> worst-case quadratic-time in the algorithm here

In which case inserts are not amortized to O(1).

---

• Previous message (by thread): finding items that occur more than once in a list
• Next message (by thread): finding items that occur more than once in a list
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

---

More information about the Python-list mailing list