In python/algorithms, what is the time complexity of the in operation for dictionaries (e.g. you have d = {'a':1, 'b':2, 'c':3, 'd':4, 'e':5}, what is big-O of doing: if 'e' in d: ?
contains (in)
Answer
O(1)
Question
In python/algorithms, what is the time complexity of the in operation for dictionaries (e.g. you have d = {'a':1, 'b':2, 'c':3, 'd':4, 'e':5}, what is big-O of doing: if 'e' in d: ?
contains (in)
Answer
?
Question
In python/algorithms, what is the time complexity of the in operation for dictionaries (e.g. you have d = {'a':1, 'b':2, 'c':3, 'd':4, 'e':5}, what is big-O of doing: if 'e' in d: ?
contains (in)
Answer
O(1)
If you want to change selection, open document below and click on "Move attachment"
pdf
owner: kkhosravi - (no access) - ProblemSolvingwithAlgorithmsandDataStructures.pdf, p61
Summary
status
not learned
measured difficulty
37% [default]
last interval [days]
repetition number in this series
0
memorised on
scheduled repetition
scheduled repetition interval
last repetition or drill
Details
No repetitions
Discussion
Do you want to join discussion? Click here to log in or create user.