A Priority Queue is a data structure of sorts.

It lets you compare items that are adjacent in a ranking, swapping the priority of the two items until the highest priority are at the top, the lowest at the bottom.

This style of relative comparison avoids problems that would otherwise need to be answered by giving an arbitrary value to something. When asked to estimate how long it would take to do something, you either pick hours, or effort, or some dollar amount. It can be more useful to instead collect all the tasks to be done, then rank them by relative difficulty. That way we can at least be confident about the easiest and most difficult, without wasting time and effort measuring completion dates.

I just want the high value, low effort items.

Backlinks