Time Complexity of HashMap methods?

The source is often helpful: kickjava.com/src/java/util/HashMap.java.htm.

The source is often helpful: kickjava.com/src/java/util/HashMap.java.htm remove: O(1) size: O(1) values: O(n) (on traversal through iterator).

You can always take a look on the source code and check it yourself. Anyway... I once checked the source code and what I remember is that there is a variable named size that always hold the number of items in the HashMap so size() is O(1).

I'm new to Java so I have no idea about source codes, but i'll give it a try. Thanks! – Koeneuze Jan 2 at 10:40.

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.