x in/not in s
O(1)
compare to list/tuple - O(N)
s.remove(..)
O(1)
compare to list/tuple - O(N)
s.pop()
O(1)
popped value “randomly” selected
set(…)
O(len(…))
depends on length of … iterable
s != t
O(len(s))
same as len(t); False in O(1) if the lengths are different
s >= t
O(len(t))
issuperset s <= t == t >= s
for v in s:
O(N)
Worst: no return/break in loop
