Suppose you want to use Heapsort to sort the contents of the following array in alphabetical order: [C; A; G; B; D; F; E]. Answer the two questions that follow. What follows is a fill in the blank question with 7 blanks. Show the array's contents after the heapBuild method has been performed, i.e. when the array represents a heap. Fill in only one letter in each space. [ Blank 1. ____________ ; Blank 2. _____________. ; Blank 3. ______________ ; Blank 4. ___________. ; Blank 5. ___________. ; Blank 6. _______________ ; Blank 7.___________ ] [Hint: think whether you need a max or a min heap to sort in alphabetical order]
Suppose you want to use Heapsort to sort the contents of the following array in alphabetical order:
[C; A; G; B; D; F; E].
Answer the two questions that follow.
|
What follows is a fill in the blank question with 7 blanks.
Show the array's contents after the heapBuild method has been performed, i.e. when the array represents a heap. Fill in only one letter in each space. [ Blank 1. ____________ ; Blank 2. _____________. ; Blank 3. ______________ ; Blank 4. ___________. ; Blank 5. ___________. ; Blank 6. _______________ ; Blank 7.___________ ]
[Hint: think whether you need a max or a min heap to sort in alphabetical order] |
Step by step
Solved in 3 steps with 1 images
Suppose you want to use Heapsort to sort the contents of the following array in alphabetical order:
[C; A; G; B; D; F; E].
Answer the two questions that follow.
|
What follows is a fill in the blank question with 7 blanks.
Show the array's contents after the first deletion operation has been performed on the heap resulting from the previous question. Fill in only one letter in each open space. |
by Bartleby Expert
