Efficiency test of adding and querying ArrayList and LinkedList

 Single column set ArrayList  And  LinkedList
ArrayList    Array set     Quick query    Adding and deleting intermediate elements is inefficient 
LinkedList   Linked list set     Slow query    Additions and deletions quickly 

 Here is a program to test  ArrayList  And  LinkedList  Insert 、 Query time efficiency , As shown below ：

import java.util.ArrayList;
import java.util.LinkedList;

/**
 * @author bzc
 * @date 2022/1/25
 * @apiNote ArrayList & LinkedList  Adding and querying time-consuming tests 
 */
public class ArrayListVSLinkList {

        public static void main(String[] args) {
        /**
         * Test insertion time 
         */
        ArrayList<Integer> arrayListInsert = new ArrayList<>();
        LinkedList<Integer> linkedListInsert = new LinkedList<>();
            for (int i = 0; i < 100000; i++) {
                arrayListInsert.add(i);
                linkedListInsert.add(i);
            }
        //Arraylist Insertion time 
        Long arrayListStart1 = System.currentTimeMillis();//currentTimeMillis() What we get is from 1970-1-01 00:00:00.000  Time distance difference from the current time , The type is long
            for (int i = 0; i < 100000; i++) {
                arrayListInsert.add(1000, i);
            }
        Long arrayListEnd1 = System.currentTimeMillis();
            System.out.println("ArrayList Insertion time ："+(arrayListEnd1 - arrayListStart1)+"ms");

        //LinkedList Insertion time 
        Long linkedListStart1 = System.currentTimeMillis();
            for (int i = 0; i < 100000; i++) {
                linkedListInsert.add(1000, i);
            }
        Long linkedListEnd1 = System.currentTimeMillis();
            System.out.println("LinkedList Insertion time ："+(linkedListEnd1 - linkedListStart1)+"ms");

        System.out.println("———————————————————————————————");
            /**
             *  Test query time 
             */
        ArrayList<Integer> arrayListFind = new ArrayList<>();
        LinkedList<Integer> linkedListFind = new LinkedList<>();
            for (int i = 0; i < 100000; i++) {
                arrayListFind.add(i);
                linkedListFind.add(i);
            }
        //ArrayList Query time consuming 
        long arrayListStart2 = System.currentTimeMillis();
            for (int i = 0; i < 100000; i++) {
                arrayListFind.get(5000);
            }
        long arrayListEnd2 = System.currentTimeMillis();
            System.out.println("ArrayList Query time ："+(arrayListEnd2 - arrayListStart2)+"ms");
        //LinkedList Query time consuming 
        long linkedListStart2 = System.currentTimeMillis();
            for (int i = 0; i < 100000; i++) {
                linkedListFind.get(5000);
            }
        long linkedListEnd2 = System.currentTimeMillis();
            System.out.println("LinkedList Query time ："+(linkedListEnd2 - linkedListStart2)+"ms");
        }
}

Here are the results ：

In a lot of times , Insertion time , LinkedList  In terms of time efficiency, it is much better than ArrayList ; And the query takes time , ArrayList  In terms of time efficiency, it is much better than  LinkedList.