What is the time complexity of inserting at the end in dynamic arrays?

BPSC TRE · TRE 3.0 · Classes 6–10 (SC/ST Welfare Dept) · Computer · 22 Jul 2024 · Shift 2 · Subject

1. A.

   O(1)

2. B.

   O(n)

3. C.

   Either O(1) or O(n)

4. D.

   More than one of the above

5. E.

   None of the above

Attempted by 131 students.