'Heap segment' presentation slideshows

Hank Childs, University of Oregon

696 views • 59 slides

DEPTH

729 views • 52 slides

6.3.1 Heapsort

6.3.1 Heapsort. Idea: two phases: 1. Construction of the heap 2. Output of the heap For ordering number in an ascending sequence: use a Heap with reverse order: the maximum number should be at the root (not the minimum). Heapsort is an in-situ-Procedure.

204 views • 8 slides

6.3.1 Heapsort

6.3.1 Heapsort. Idea: two phases: 1. Construction of the heap 2. Output of the heap For ordering number in an ascending sequence: use a Heap with reverse order: the maximum number should be at the root (not the minimum). Heapsort is an in-situ-Procedure.

86 views • 8 slides