What is the time complexity of basic operations get() and put() in HashMap class?

Question 1

Question 2

The time complexity is O(1) assuming that the hash function used in the hash map distributes elements uniformly among the buckets

DavidAnderson · Answer 1 · 2023-08-10T04:02:34+0000

The time complexity is O(1) assuming that the hash function used in the hash map distributes elements uniformly among the buckets

Please log in or register to answer this question.