Paul Rubin phr-n2003b at NOSPAMnightsong.com
Tue Feb 4 20:53:14 EST 2003

• Previous message (by thread): sorting a dictionary
• Next message (by thread): sorting a dictionary
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

---

"Giovanni Bajo" <noway at sorry.com> writes:
> Doesn't d[k] require O(logN) too? Or is Python smart enough to
> optimize this away since we are going through the dictionary?

Dictionary access is supposed to be constant time (hash lookup).

---

• Previous message (by thread): sorting a dictionary
• Next message (by thread): sorting a dictionary
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

---

More information about the Python-list mailing list