python priority queue customized comparator

First in First out (FIFO) remember?īut let us think for a second if this approach will work or not. for this, You can go for a normal list structure such as an ArrayList which will linearly store all your tasks, or you can use a Queue which will store and present your tasks exactly in the order that you entered them in. That way you don't have to worry about forgetting to complete a particular task and can also manage your time.

Now let us say you have a bad memory and you want to use a data structure in which you can store all your tasks and keep checking that data structure at regular intervals to see which task you have to perform next. lastly, you also have to do the laundry that you have been avoiding for the past few days.you have to submit an assignment for your college that is due today.you want to pick up a new game that just launched from the game shop.Let us imagine a scenario where you have 3 tasks to complete. Introductionīefore we move ahead, let's look at one simple example to understand how things work on a surface level. So without wasting much time, Let's dive in. Java Program to Create a Comparator Directly in Java Using PriorityQueue.Java Program to Create a Custom Comparator in Java Using PriorityQueue.What are priority queues and Comparator Interface.

Ok so enough stories, let's look at what you are going to learn in this article. In this article, you'll learn how a priority queue uses the Java priority queue Comparator to achieve its goal. But do you know how a priority queue decides an element's relative priority and decide which elements need to be on top of the queue and which don't? Well, it uses an interface called Comparator and a comparator lets you define how and on what basis you what your priority queue to sort the elements. It lets you do amazing things, whether you want to sort your marks from best to worst or to arrange your friends from most annoying to least annoying, you can do that with the help of priority queues. You can put something in your priority queue and get back the results in sorted order or more precisely, according to each element's relative priority. If you have worked with java previously then you definitely would have heard about this amazing data structure called a Priority queue and also a special something called a comparator.

Python priority queue customized comparator