Time complexity of "add" from Apache Commons Lang class 'ArrayUtils'

Question

I am wondering if this method of adding to primitive array is still constant time?

char[] arrayA = {'b', 'c'};
char[] arrayB = ArrayUtils.add(arrayA, 0, 'a');
// arrayB: [a, b, c]

@Michael all it says is this: Copies the given array and adds the given element at the end of the new array. I do not know how to tell the answer to my question from that — B. Sen
– B. Sen, Commented Sep 25, 2019 at 12:39

Mustahsan · Accepted Answer · 2019-09-25 12:48:43Z

1

You can look at the implementation here

Basically in the end it uses System.arraycopy which has a complexity of O(n)

Mustahsan

3,8421 gold badge22 silver badges35 bronze badges

answered Sep 25, 2019 at 12:46

Veselin Davidov

7,0911 gold badge17 silver badges23 bronze badges

Sign up to request clarification or add additional context in comments.

1 Answer 1