Ebook Data structures and algorithms in C++: Part 2
➤ Gửi thông báo lỗi ⚠️ Báo cáo tài liệu vi phạmNội dung chi tiết: Ebook Data structures and algorithms in C++: Part 2
Ebook Data structures and algorithms in C++: Part 2
Chapter8Heaps and Priority QueuesContents8.1The Priority Queue Abstract DataType..................3228.1.1Keys, Priorities, and Total Order Relations. Ebook Data structures and algorithms in C++: Part 2........3228.1.2Comparators.........................................3248.1.3The Priority Queue ADT..............................3278.1.4A C++ Priority Queue Interface......................3288.1.5Sorting with a Priority Queue.......................3298.1.6The STL priority .queue Class............... Ebook Data structures and algorithms in C++: Part 2........3308.2Implementing a Priority QueuewithaList.............3318.2.1A C++ Priority Queue Implementation using a List . 3338.2.2Selection-Sort andEbook Data structures and algorithms in C++: Part 2
Insertion-Sort...................3358.3Heaps.....................................................3378.3.1The Heap Data Structure.....................Chapter8Heaps and Priority QueuesContents8.1The Priority Queue Abstract DataType..................3228.1.1Keys, Priorities, and Total Order Relations. Ebook Data structures and algorithms in C++: Part 2on .................................3498.3.5Heap-Sort...........................................3518.3.6Bottom-Up Heap Construction -k .....................3538.4Adaptable Priority Queues.................................3578.4.1A List-Based Implementation.........................3588.4.2Location-Awa Ebook Data structures and algorithms in C++: Part 2re Entries..............................3608.5Exercises.................................................361322Chapter 8. Heaps and Priority Queues8.1Ebook Data structures and algorithms in C++: Part 2
The Priority Queue Abstract Data TypeA priority queue is an abstract data type for storing a collection of prioritized elements that supports arbitrarChapter8Heaps and Priority QueuesContents8.1The Priority Queue Abstract DataType..................3228.1.1Keys, Priorities, and Total Order Relations. Ebook Data structures and algorithms in C++: Part 2DT is fundamentally different from the position-based data structures such as stacks, queues, deques, lists, and even trees, we discussed in previous chapters. These other data structures store elements at specific positions, which are often positions in a linear arrangement of the elements determin Ebook Data structures and algorithms in C++: Part 2ed by the insertion and deletion operations performed. The priority queue ADT stores elements according to their priorities, and has no external notioEbook Data structures and algorithms in C++: Part 2
n of “position."8.1.1 Keys, Priorities, and Total Order RelationsApplications commonly require comparing and ranking objects according to parameters oChapter8Heaps and Priority QueuesContents8.1The Priority Queue Abstract DataType..................3228.1.1Keys, Priorities, and Total Order Relations. Ebook Data structures and algorithms in C++: Part 2t as a specific attribute for that element and that can be used to identify, rank, or weigh that element. Note that the key is assigned to an element, typically by a user or application; hence, a key might represent a property that an element did not originally possess.The key an application assigns Ebook Data structures and algorithms in C++: Part 2 to an element is not necessarily unique, however, and an application may even change an element’s key if it needs to. For example, we can compare comEbook Data structures and algorithms in C++: Part 2
panies by earnings or by number of employees; hence, either of these parameters can be used as a key for a company, depending on the information we wiChapter8Heaps and Priority QueuesContents8.1The Priority Queue Abstract DataType..................3228.1.1Keys, Priorities, and Total Order Relations. Ebook Data structures and algorithms in C++: Part 2 we allow a key to be of any type that is appropriate for a particular application.As in the examples above, the key used for comparisons is often more than a single numerical value, such as price, length, weight, or speed. That is. a key can sometimes be a more complex property that cannot be quant Ebook Data structures and algorithms in C++: Part 2ified with a single number. For example, the priority of standby passengers is usually determined by taking into account a host of different factors,Ebook Data structures and algorithms in C++: Part 2
including frequent-flyer status, the fare paid, and check-in time. In some applications, the key for an object is data extracted from the object itselChapter8Heaps and Priority QueuesContents8.1The Priority Queue Abstract DataType..................3228.1.1Keys, Priorities, and Total Order Relations. Ebook Data structures and algorithms in C++: Part 2 the object but is externally generated by the application (for example, the quality rating given to a stock by a financial analyst, or the priority assigned to a standby passenger by a gate agent).8.1. The Priority Queue Abstract Data Type323Comparing Keys with Total OrdersA priority queue needs a Ebook Data structures and algorithms in C++: Part 2comparison rule that never contradicts itself. In order for a comparison rule, which we denote by <, to be robust in this way. it must define a totalEbook Data structures and algorithms in C++: Part 2
order relation, which is to say that the comparison rule is defined for every pair of keys and it must satisfy the following properties:•Reflxive propChapter8Heaps and Priority QueuesContents8.1The Priority Queue Abstract DataType..................3228.1.1Keys, Priorities, and Total Order Relations.Chapter8Heaps and Priority QueuesContents8.1The Priority Queue Abstract DataType..................3228.1.1Keys, Priorities, and Total Order Relations.Gọi ngay
Chat zalo
Facebook