Performance: Iterating through a List in Java

Question

Is it slower to iterate through a list in Java like this:

for (int i=0;i

as opposed to:

Answer 1

It is recognized that the distinction between random and sequential * access is often fuzzy. For example, some List implementations * provide asymptotically linear access times if they get huge, but constant * access times in practice. Such a List implementation * should generally implement this interface. As a rule of thumb, a * List implementation should implement this interface if, * for typical instances of the class, this loop: *

 *     for (int i=0, n=list.size(); i < n; i++)
 *         list.get(i);
 * 

* runs faster than this loop: *

 *     for (Iterator i=list.iterator(); i.hasNext(); )
 *         i.next();
 * 

*