Efficiency comparison between ArrayList and LinkedList

ArrayList And LinkedList Comparison of efficiency

I read many articles on the Internet and said ,ArrayList The query efficiency of is better than LinkedList, The efficiency of adding and deleting is lower than LinkedList. There is a problem with this statement ,ArrayList At the bottom is an array , Inserting is actually adding , Indeed, a little efficiency will be lost during capacity expansion , But this loss basically doesn't need to be considered .
Next, we will conduct a test with millions of data

First, look at the increase

long s=System.currentTimeMillis();
        ArrayList arrayList=new ArrayList();
        for (int i = 0; i < 1000000; i++) {
    
            arrayList.add(i);
        }
        System.out.println("ArrayList Tail insertion  "+(System.currentTimeMillis()-s));

        s=System.currentTimeMillis();
        LinkedList linkedList=new LinkedList();
        for (int i = 0; i < 1000000; i++) {
    
            linkedList.add(i);
        }
        System.out.println("LinkedList increase  "+(System.currentTimeMillis()-s));

The result is ArrayList It's faster than LinkedList

Delete

long s=System.currentTimeMillis();
        String str="";
        for (int i = 999999; i > -1; i--) {
    
            arrayList.remove(i);
        }
        System.out.println("ArrayList Deletion at the end  "+(System.currentTimeMillis()-s));

        s=System.currentTimeMillis();
        for (int i = 999999; i > -1; i--) {
    
            linkedList.removeLast();
        }

        System.out.println("linkedList Deletion at the end  "+(System.currentTimeMillis()-s));

The result is ArrayList The speed of is better than LinkedList

It's also necessary to execute more times ArrayList Is faster than LinkedList