[工学]算法chap06-new.pptVIP

* * * * * * * * * * Analysis: Constant time assignment + Time for MAX-HEAPIFY Time: O(lg n). Increasing Key Value: INCREASE-KEY(S, x, k) Given set S, element x, and new key value k: Make sure k ≥ x’s current key. Update x’s key value to k. Traverse the tree upward comparing x to its parent and swapping keys if necessary, until x’s key is smaller than its parent’s key. Analysis: Upward path from node i has length O(lg n) in an n-element heap. Time: O(lg n) Inserting into the Heap: INSERT(S, x) Analysis: constant time assignments + time for HEAP-INCREASE-KEY. Time: O(lg n) Given a key k to insert into the heap: Insert a new node in the very last position in the tree with key -∞. Increase the -∞ key to k using the HEAP-INCREASE-KEY procedure defined above. Homework 6.1-7, 6.2-6,6.3-3 6.4-2 * * * * * * * * * * * * * * * * * * * * * * * * * * Chapter 6. HeapSort Sorting Problem Input: A sequence of n numbers Output: A permutation (reordering) of the input sequence such that HeapSort O(n lg n) worst case – like merge sort Sorts in place – like insertion sort Only a constant number of array elements are stored outside the input array at any time Combines the best of both algorithms Design technique: use of a data structure:heap To understand HeapSort, study Heaps and Heap operations Priority Queues. Heap: Data Structure(1) (Binary) Heap is a nearly complete binary tree. The tree is completely filled on all levels except possibly the lowest , which is filled from the left up to a point Properties of a heap (represented by an array A) Length [A]: # of elements in A Heap-size [A]: # of elements in the heap stored within A Height of node = # of edges on a longest simple path from the node down to a leaf. Height of heap = height of root = ?(lg n). A heap can be stored as an array A[1 .. n]. Root of tree is A[1]. Parent of A[i ] = Left child of A[i ] = A[2i ]. Right child of A[i ] = A[2i + 1]. Computing is fast with binary