easy5 pts · first answer countsarraystime-complexityjavascript

Using shift as a queue

You use a JavaScript array as a queue with push and shift on 1,00,000 items. Why can this be slow?

A.push becomes O(n) once the array is very largeB.shift sorts the remaining items before returningC.Arrays cannot hold more than 65,536 itemsD.shift moves every remaining element down, so it is O(n)

Discussion 0

Join free to post in the discussion.

Using shift as a queue

Discussion 0

Related questions