This week's book giveaway is in the JavaFX forum. We're giving away four copies of Introducing JavaFX 8 Programming and have Herbert Schildt on-line! See this thread for details.

Complexity does not depend on the class, it depends on the operation, i.e. insert, lookup, delete. The javadocs for these classes give some clues of what can be expected.

Can some tell what is this time complexity of a collection?. what its value of Arraylist, Vector, LinkedList.

Time Complexity is not something remaining constant throughout the universe. It varies with how (insert, lookup, iterate, clear etc) you use the collecton, what (application specific: to store shared or non shared resources, thread safe or non thread safe resources) you use the collection for and where(Implementation specific : batch, online, long continous use) you use it.

The time complexity of a problem is the number of steps that it takes to solve an instance of the problem as a function of the size of the input (usually measured in bits), using the most efficient algorithm. To understand this intuitively, consider the example of an instance that is n bits long that can be solved in n� steps. In this example we say the problem has a time complexity of n�. Of course, the exact number of steps will depend on exactly what machine or language is being used. To avoid that problem, we generally use Big O notation. If a problem has time complexity O(n�) on one typical computer, then it will also have complexity O(n�) on most other computers, so this notation allows us to generalize away from the details of a particular computer.

Going back to the original question, Vector is theoretically slower than ArrayList or LinkedList, since its synchronized, but I don't have metrics for this. Are you concerned with which is faster or worst case algorithm analysis? [ December 06, 2005: Message edited by: Scott Selikoff ]