In Queue the `dequeue` should be O(1) complexity

[fahimfaisaal]

From this Queue implementation I believe the Operation is O(n) cause the complexity of Array.prototype.shift methods is O(n), see

[ayDavidGitHere]

Dequeue on queue works on a O(n) complexity.
To achieve dequeue on O(1) use linked-lists.

https://github.com/ayDavidGitHere/Javascript/tree/master/Data-Structures/Linked-List

[fahimfaisaal]

Yeah, I see.

[appgurueu]

The queue should be implemented using linked lists. The current implementation is clearly suboptimal for no good reason.

[raklaptudirm]

@fahimfaisaal Are you working on this issue?

[fahimfaisaal]

Yep.. I'll send pr soon.

[raklaptudirm]

@fahimfaisaal You still haven't sent a pull request. Are you working on this, or should I put this issue up for grabs?

[fahimfaisaal]

@raklaptudirm I apologize for my latency.