Algorithms: priority queues

Implement and check a heap invariant.

How to study this source

• How do I choose an algorithm?

  criticismNamed section and worked examples

  Implement and check a heap invariant.

Ideas and questions

Read background definitions when a term blocks the argument. Then return to the source and reconstruct its claim in your own words.

Read alongside, read against

• Algorithms: union–find

  Robert Sedgewick · Kevin Wayne. Compare assumptions, evidence and scope with the source above. These are editorial companions, not necessarily direct responses.

• Algorithms: elementary sorts

  Robert Sedgewick · Kevin Wayne. Compare assumptions, evidence and scope with the source above. These are editorial companions, not necessarily direct responses.

• Algorithms: mergesort

  Robert Sedgewick · Kevin Wayne. Compare assumptions, evidence and scope with the source above. These are editorial companions, not necessarily direct responses.

• Algorithms: quicksort

  Robert Sedgewick · Kevin Wayne. Compare assumptions, evidence and scope with the source above. These are editorial companions, not necessarily direct responses.

• Algorithms: sorting applications

  Robert Sedgewick · Kevin Wayne. Compare assumptions, evidence and scope with the source above. These are editorial companions, not necessarily direct responses.