What is the time complexity of a size() call on a LinkedList in Java?

java size linked-list time-complexity
Martin Andersson picture Martin Andersson · May 14, 2009 · Viewed 26.5k times · Source

As the title asks, I wonder if the size() method in the LinkedList class takes amortized O(1) time or O(n) time.

Answer

GreenieMeanie picture GreenieMeanie · May 14, 2009

It's O(1). You can google for the source code and you will come to such:

From http://www.docjar.com/html/api/java/util/LinkedList.java.html

All of the Collection classes I have looked at store a the size as a variable and don't iterate through everything to get it.

Related questions

How to change the size of the font of a JLabel to take the maximum size

I have a JLabel in a Container. The defaut size of the font is very small. I would like that the text of the JLabel to take the maximum size. How can I do that?

Read More
Java JTable setting Column Width

I have a JTable in which I set the column size as follows: table.setAutoResizeMode(JTable.AUTO_RESIZE_OFF); table.getColumnModel().getColumn(0).setPreferredWidth(27); table.getColumnModel().getColumn(1).setPreferredWidth(120); table.getColumnModel().getColumn(2).setPreferredWidth(100); table.getColumnModel().getColumn(3).setPreferredWidth(90); table.getColumnModel().getColumn(4).setPreferredWidth(90); table.…

Read More
Determine the size of an InputStream

My current situation is: I have to read a file and put the contents into InputStream. Afterwards I need to place the contents of the InputStream into a byte array which requires (as far as I know) the size of …

Read More