r/learnjavascript • u/elediardo • May 16 '22
Explanation of a queue data structure in JavaScript
24
May 16 '22
The time complexity for dequeueing in this implementation is O(n). You could achieve O(1) by using a linked list instead of an array. Arrays work well as stacks, but not so well as queues.
3
u/Miserable_Decision_4 May 16 '22
I've mess with Linked Lists in C plenty, but how could you mimic/create one in JS?
22
May 16 '22 edited May 16 '22
class Node { constructor(val) { this.val = val this.next = null this.prev = null }}
class DoublyLinkedList { constructor() { this.head = null this.tail = null this.length = 0 } push(val) { const newNode = new Node(val) if (this.tail) { this.tail.next = newNode newNode.prev = this.tail } else { this.head = newNode } this.tail = newNode this.length++ } pop() { if (this.tail) { const oldTail = this.tail this.tail = oldTail.prev this.tail.next = null this.length-- oldTail.prev = null return oldTail } else { return null } } shift() { if (this.head) { const oldHead = this.head this.head = oldHead.next this.head.prev = null this.length-- oldHead.next = null return oldHead } else { return null } } unshift(val) { const newNode = new Node(val) if (this.head) { this.head.prev = newNode newNode.next = this.head } else { this.tail = newNode } this.head = newNode this.length++ } }EDIT: Formatting, Reddit is not good at this.
1
1
u/kundun May 17 '22
Array.prototype.shift() has a time complexity of O(1). Instead of moving every item one by one like you might expect, most javascript engines just move the pointer of the front of the array over by one.
1
May 17 '22
Source? A little quick and dirty testing suggests that this is not true in Node.js.
shift()performs worse on an array with a million elements than it does on array with a thousand elements, which in turn performs worse than array with a single element. This strongly suggests linear time complexity. It also seems like it would be a bit of a strange design choice to me, because afaik, you would have to add greater time complexity to element retrieval if you aren't re-indexing on every shift or unshift.2
u/kundun May 17 '22
It is how it is implemented in Firefox. I assumed that other engines did the same.
1
May 17 '22
Well, that's pretty cool. Do you know if that comes at the expense of speed of accessing elements by index?
2
u/kundun May 17 '22
Maybe I'm missing something important but I don't think it should.
I think a simplified example would look like this:
int arr[5] = {0,1,2,3,4}; //Create array with 5 elements int* pArrStart = arr; //pointer to first element of array //do shift() in js pArrStart = pArrStart++; //move pointer forward pArrStart[0]; //pArrStart[0] now points to 1As long as you have a pointer like pArrStart to the first element, you can access the nth element like pArrStart[n].
31
u/PM_ME_A_WEBSITE_IDEA May 16 '22
Excuse my naivety but is this not just an array with more steps and less functionality? I suppose maybe the restricted functionality is to avoid making mistakes?
7
u/og-at May 16 '22 edited May 16 '22
It's a "naive" implementation of a general computer science concept. (it's actually caled "naive" meaning only "first pass" or "basic attempt")
It's also "declarative programming" where you describe the action, as opposed to instructing every step (imperative).
Yes you could use an array, but this kind of layout contains the code and can make things more readable.
I mean I'd rather see
if (tickets.isEmpty) {}than the array machinations that may need to go on when(ticketsArray.length === 0)is detected as empty.Perfect example I thought of when typing that is that
.lengthwill cause an error if ticketsArray hasn't yet received it's value from global state.queue.IsEmpty()can account for that and return a valid state.
lengthisn't a huge thing by itself, but we're talking concepts here.btw...
Declarative = "run to the store for pencils".
Imperative = "get your spectacles testicles wallet n keys, get in the car, drive to PlebMart, go to aisle 6, find pencils on the left about halfway down."
6
u/bedekelly May 16 '22
FYI, this isn’t a correct understanding of declarative vs imperative code. I’ll summarise them both for reference.
Imperative code is a step-by-step list of instructions for exactly what the computer should do. Pack your bag, get your keys, drive down the street, and so on. Procedural code improves this by allowing the programmer to split up units of code that are often reused, like buying something from the store. Buying eggs and buying milk have a lot of things in common, for example.
Declarative code is quite different, and involves describing the desired state of the world. In your example, a declarative program might say “I should have some pencils”. It’s up to the lower-level implementation, which is often written in a more imperative style, to describe the actual process of going to a store and buying something.
Please do reply if I can help clarify this more.
2
13
2
u/dee_jay_mon May 16 '22
const queue = []
queue.length //if 0 is empty
queue.push('x')
queue.push('y')
queue[0]
queue.shift()
0
u/genial95 May 16 '22
Damn, I don't think I've seen a better example of a class use case.
6
u/CreamyJala May 16 '22
Classes are useful for many many things. But any sort of data structure is a match made in heaven.
0
0
3
u/asking_for_a_friend0 May 16 '22
what did u use to make it?
/edit the inforgraphic