Question: Suppose the array to be sorted (into alphabetical order) by Heapsort initially contains the following sequence of letters: C O M P L E X
Suppose the array to be sorted (into alphabetical order) by Heapsort initially contains the following sequence of letters:
C O M P L E X I T Y
Show how they would be arranged in the array after the heap construction phase . How many key comparisons are done to construct the heap with these keys?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
