easy5 pts · first answer countsarraystime-complexity

Inserting at the front of an array

You call arr.unshift(x) on an array with n elements. Why is this usually O(n)?

A.Every existing element must shift one place rightB.The array must be sorted again after insertionC.The engine must hash every element againD.The new value is compared with every element

Discussion 0

Join free to post in the discussion.

Inserting at the front of an array

Discussion 0

Related questions