Queues can be done more performant using heaps, that we’ll take a look at inĪnother post.), especially the “Implementation” section. Implementing priority queues and you are quite right. Until then you can take a look at priority queues’ WikiĪbout queues you might think that these are not the most performant ways of There’s more interesting knowledge around priority queues that we can explore. Implementing priority queues can be done more performant using heaps, that

Most performant ways of implementing priority queues and you are quite right. If you are knowledgeable about queues you might think that these are not the Basically, ourīelt gets implicitly sorted by the priority as we add new Luggage to it. The new one and of course, not at the beginning of the Belt. The new Luggage was added right after the Luggage with the same priority as To demonstrate the new Add functionality, we can run the following code: Item in our queue will cost us the same - O(n). Our new Add function has a time complexity of O(n)īecause in worst case scenario it will have to traverse the whole slice before Of course, if the loop doesn’t find such a Luggage it will just append it to The Luggage has the further to the beginning of the Belt it will be placed. Then it finds a Luggage that has a smaller priority it bypasses itĪnd puts the new luggage in front of it. The second case, when there’s more than one item on the Belt, loops throughĪll of the luggage on the Belt and compares their priority with the new oneĬoming on. Theīelt will have only one item on it and that one will be the first that can be

If theīelt is empty, we just put the new luggage on the belt and we are done. There areĪ couple of things going on here and the first case is quite simple. Also, later on, we will see how we can keep the history of the actionsĪ simple Action struct would look something like:įunc (history *ActionHistory ) Undo () *Action Ĭompared to the previous implementation, this is rather complicated. Let’s try to think how we would model the actions each of these applications Opportunity? Let’s explore a data structure that can help us with such a task. Have you ever considered how you would program such functionality if given the “Undo” and “Redo” the actions we have applied. Ubiquitous functionality that we expect from these tools - the ability to Like adding colour to the text, underline, various fonts and sizes As you might know, these apps come with various actions one can apply

You know, the most ubiquitous applicationsįor composing documents that humanity has invented. In this post, we will look at two similar but In a previous post 1, we took a look at linked lists and how we can apply

Queue vs stack vs heap