Lisades elemendi kogumiks lõppu, milline andmestruktuur — ArrayList või LinkedList — töötab kiiremini?

Adding an element to the end of the collection:

• ArrayList generally works faster if there is enough space in the array because the addition occurs in amortized O(1) time — the element is simply written into the next free cell.

• If the array is full, an expansion occurs (copying to a new array), which takes more time.

• LinkedList always adds an element at the end in O(1), as a new node is simply created and links are changed.

In practice, for adding to the end, if we do not consider array expansion, ArrayList is faster due to better data locality and lower overhead for node management. LinkedList is advantageous if frequent insertions/deletions in the middle of the list are needed.

Example:

ArrayList<Integer> arrayList = new ArrayList<>();
arrayList.add(10); // Fast if there is space

LinkedList<Integer> linkedList = new LinkedList<>();
linkedList.add(10); // Always fast, but with higher costs