数据结构An Introduction to Sorting.pptVIP

* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * Adding an Entry Fig. 28-3 A revision of steps shown in Fig. 28-2 to avoid swaps. …. continued → Adding an Entry Fig. 28-3 (ctd.) A revision of steps shown in Fig. 28-2 to avoid swaps. Adding an Entry Fig. 28-4 An array representation of the steps in Fig. 28-3 … continued → Adding an Entry Fig. 28-4 (ctd.) An array representation of the steps in Fig. 28-3. Click to view method add Removing the Root Fig. 28-5 The steps to remove the entry in the root of the maxheap of Fig. 28-3d Removing the Root Fig. 28-6 The steps that transform a semiheap into a heap without swaps. Removing the Root To remove a heaps root Replace the root with heaps last child This forms a semiheap Then use the method reheap Transforms the semiheap to a heap View method removeMax Creating a Heap Fig. 28-7 The steps in adding 20, 40, 30, 10, 90, and 70 to a heap. Creating a Heap Fig. 28-8 The steps in creating a heap by using reheap. View use in constructor. Heapsort Possible to use a heap to sort an array Place array items into a maxheap Then remove them Items will be in descending order Place them back into the original array and they will be in order Heapsort Fig. 28-9 A trace of heapsort (a – c) Heapsort Fig. 28-9 A trace of heapsort (d – f) Heapsort Fig. 28-9 A trace of heapsort (g – i) Heapsort Fig. 28-9 A trace of heapsort (j – l) Heapsort View implementation of a heapSort Efficiency is O(n log n). However, quicksort is usually a better choice Note it also uses reheap View source code of reheap * * * * * * * * * * * * * * * * * Faster Sorting Methods * Chapter Contents Merge Sort Merging Arrays Recursive Merge Sort The Efficiency of Merge Sort Iterative Merge Sort Merge Sort in the Java Class Library Chapter Contents Quick Sort The Efficiency of Quick Sort Creating the Partition Java Code for Quick Sort Quick Sort in the Java Class Library Radix Sort Pseudocode for Radix So