第02章_基本数据结构Priority_Queues_Heaps_Dictionaries_Hash_Tables.ppt

Priority Queues Priority Queues Priority Queues Priority Queue ADT A priority queue stores a collection of items An item is a pair(key, element) Main methods of the Priority Queue ADT insertItem(k, o)inserts an item with key k and element o removeMin()removes the item with smallest key and returns its element Additional methods minKey()returns, but does not remove, the smallest key of an item minElement()returns, but does not remove, the element of an item with smallest key size(), isEmpty() Applications: Standby flyers Auctions Stock market Total Order Relation Keys in a priority queue can be arbitrary objects on which an order is defined Two distinct items in a priority queue can have the same key Mathematical concept of total order relation ? Reflexive property:x ? x Antisymmetric property:x ? y ? y ? x ? x = y Transitive property: x ? y ? y ? z ? x ? z Comparator ADT A comparator encapsulates the action of comparing two objects according to a given total order relation A generic priority queue uses an auxiliary comparator The comparator is external to the keys being compared When the priority queue needs to compare two keys, it uses its comparator Methods of the Comparator ADT, all with Boolean return type isLessThan(x, y) isLessThanOrEqualTo(x,y) isEqualTo(x,y) isGreaterThan(x, y) isGreaterThanOrEqualTo(x,y) isComparable(x) Sorting with a Priority Queue We can use a priority queue to sort a set of comparable elements Insert the elements one by one with a series of insertItem(e, e) operations Remove the elements in sorted order with a series of removeMin() operations The running time of this sorting method depends on the priority queue implementation Sequence-based Priority Queue Implementation with an unsorted sequence Store the items of the priority queue in a list-based sequence, in arbitrary order Performance: insertItem takes O(1) time since we can insert the item at the beginning or end of the sequence removeMin, minKey and minElement take O(n) ti