Say I have a ArrayList with n element in this array, and I add an element at the beginning:
myArrayList.add(0,'some value');
What will be the time complexity of this operation?
The Java Doc doesn't specify this.
Also
I just start learning Java, and I saw the sentence
An ArrayList in Java is a List that is backed by an array.
What does 'backed' here mean? Thank you!
Adding an element to beginning of array is O(n) - it would require to shift all the existing elements by one position.
All elements in an array list are stored in a contiguous array. If you add more elements than the current size of the array - it will be grown automatically to accommodate the new element.
Addition to the end is O(1) amortized over multiple insertions.
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With