개발챙 AI study
/
Python
/
자료구조에 따른 복잡도 차이
/
Dict
Search
Share
Dict
Show All
Search
Operation
Example
Big-O
Notes
Index
Open
d[k]
O(1)
Store
Open
d[k] = v
O(1)
Length
Open
len(d)
O(1)
Delete
Open
del d[k]
O(1)
get/setdefault
Open
d.get(k)
O(1)
Pop
Open
d.pop(k)
O(1)
Pop item
Open
d.popitem()
O(1)
popped item “randomly” selected
Clear
Open
d.clear()
O(1)
similar to s = {} or = dict()
View
Open
d.keys()
O(1)
same for d.values()
Construction
Open
dict(…)
O(len(…))
depends # (key,value) 2-tuples
Iteration
Open
for k in d:
O(N)
all forms: keys, values, items