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
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.