Add to end Performance compare: LinkList and ArrayList : List « Collections Data Structure « Java

Add to end Performance compare: LinkList and ArrayList

Add to end Performance compare: LinkList and ArrayList
time for LinkedList = 501
time for ArrayList = 126
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;

public class ListDemo {
  // number of objects to add to list
  static final int SIZE = 1000000;

  static long timeList(List list) {
    long start = System.currentTimeMillis();
    Object obj = new Object();

    for (int i = 0; i < SIZE; i++) {
      // add object to the rear of the list

    return System.currentTimeMillis() - start;

  public static void main(String args[]) {
    // do timing for LinkedList
    System.out.println("time for LinkedList = " + timeList(new LinkedList()));

    // do timing for ArrayList
    System.out.println("time for ArrayList = " + timeList(new ArrayList()));


Related examples in the same category

1.Using the Double Brace Initialization.
2.Add to start Performance compare: LinkList and ArrayList
3.Convert array to list and sortConvert array to list and sort
4.Shuffle a listShuffle a list
5.Sort a listSort a list
6.Bidirectional Traversal with ListIteratorBidirectional Traversal with ListIterator
7.Int listInt list
8.Linked List example
9.List to array
10.List Reverse Test
11.Build your own Linked List class
12.List Search Test List Search Test
13.Convert a List to a Set
14.Set Operating on Lists: addAll, removeAll, retainAll, subList
15.Convert collection into array
16.Convert LinkedList to array
17.Convert Set into List
18.If a List contains an item
19.ListSet extends List and Set
20.List containing other lists
21.Helper method for creating list
22.Generic to list
23.List implementation with lazy array construction and modification tracking.
24.Utility methods for operating on memory-efficient lists. All lists of size 0 or 1 are assumed to be immutable.
25.A class that wraps an array with a List interface.
26.Splits the list.
27.Slice a list
28.A List that, like a Set, contains no duplicate Elements.
29.Determines if the given lists contain the same elements. We suppose that all the elements of the given lists are different.
30.List that allows items to be added with a priority that will affect the order in which they are later iterated over.