Conversation

@gdad_s_river I don't think the answer you got on hashnode is quite right.

In principle, because tiny-queue is just a linked list, a shift() is O(1), whereas on an array list a shift() would require copying all items one position over, so it's potentially O(n). (Unless the implementation is clever enough to just keep a pointer to the first item and move it over.)