Using collection size in for loop comparison

Question

Is there a compiler optimization for the size() methods of Collections in Java?

Consider the following code:

for(int i=0;i

        

Answer 1

Calling the size() method of a collection is just returning an integer value that is already kept track of. There isnt much of a time difference because size() isnt actually counting the number of items but instead the number of items are kept track of when you add or remove them.