T÷lvunarfrŠ­i 2

Weekly note 12


This week we will cover priority queues and heaps from Chapter 9 in the Algorithms book. Priority queues have the operation getmax that returns the largest item in a group of items (and removes it from the group). You can implement priority queues in many ways, but one of the fastest one uses heaps. You can also use heaps to get a very fast sorting method, heapsort.

Remember that the deadline for the second programming project is 6pm on friday April 8th.


annaing (hja) hi.is / hh (hja) hi.is, April 4th, 2005.