Time complexities Flashcards by cecil jacob

Q

What is time complexity of hashmap lookup operation?

A

“Expected” worst case runtime: O(1)
Worst case: O(n)

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

A

How well did you know this?

1

Not at all

2

3

4

5

Perfectly