Python sets and dictionaries can have quadratic-time performance
SMRTR summary
Hash collisions can degrade Python's dict/set from O(1) to quadratic time, and cache pressure alone can cause 10x lookup slowdowns at scale. A benchmark against fastconstmap reveals the real performance cost.
SMRTR provides this summary for quick context. The original article belongs to lobste.rs.
Read the original article