File APIs for Java Developers
Manipulate DOC, XLS, PPT, PDF and many others from your application.
http://aspose.com/file-tools
The moose likes Java in General and the fly likes Time Complexity of a Collection Big Moose Saloon
  Search | Java FAQ | Recent Topics | Flagged Topics | Hot Topics | Zero Replies
Register / Login


Win a copy of Spring in Action this week in the Spring forum!
JavaRanch » Java Forums » Java » Java in General
Bookmark "Time Complexity of a Collection" Watch "Time Complexity of a Collection" New topic
Author

Time Complexity of a Collection

Vivek Nidhi
Ranch Hand

Joined: Aug 10, 2003
Posts: 133
Hi,

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


regs

Vivek Nidhi
Ulf Dittmer
Marshal

Joined: Mar 22, 2005
Posts: 42289
    
  64
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.


Ping & DNS - my free Android networking tools app
jiju ka
Ranch Hand

Joined: Oct 12, 2004
Posts: 306

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.

From http://en.wikipedia.org/wiki/Computational_complexity_theory

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.

[ December 06, 2005: Message edited by: jiju ka ]
Scott Selikoff
author
Saloon Keeper

Joined: Oct 23, 2005
Posts: 3710
    
    5

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 ]

My Blog: Down Home Country Coding with Scott Selikoff
Vivek Nidhi
Ranch Hand

Joined: Aug 10, 2003
Posts: 133
Thank you very much every one.
I just want to the stuff that's it, nothing much in detail

regs
Vivek Nidhi
 
wood burning stoves
 
subject: Time Complexity of a Collection