About the Add time comparison between ArrayList and LinkedList

A little experiment was done tonight to compare two add the same data takes more time than

/**
* @param args
*/
public static void Main (string[] args) {
TODO auto-generated Method Stub
List<cat> l=new linkedlist<cat> ();
List<cat> l=new arraylist<cat> ();
Long Start=system.currenttimemillis ();
System.out.println ("Start time:" +start);
for (long i=0;i<5990000;i++) {
L.add (New Cat (i));
}
Long End=system.currenttimemillis ();
System.out.println ("End Time:" +end);
SYSTEM.OUT.PRINTLN ("Total Time:" + (End-start));
}

All say the former inserted slowly, through this little example

Did not see that the former is slower than the latter, the former is much faster than the latter, seeking high-finger teaching,

About the Add time comparison between ArrayList and LinkedList