4 ms·

Array shift is O(n). Using pop instead gives a better comparison: http://jsperf.com/while-vs-for-queue/18 http://jsperf.com/while-vs-for-queue/18

• blorenz 13y ago
  Noted. Great to see the performance increase. Obviously pop() is for the last element so a FIFO would have to be constructed with this in mind.
• cpeterso 13y ago
  If the JS engine implemented Array as a deque or circular buffer, shift() could be O(1).