Question: Section B (60 marks) the following heap sort algorithm. This includes the heap level by leve increasingly Question 2. Given the array (2 5 -1
Section B (60 marks) the following heap sort algorithm. This includes the heap level by leve increasingly Question 2. Given the array (2 5 -1 8 4 0 -3 7 3 6 -41. describe the sd the final arzay marks) steps needed for sorting array sorted (20 marks)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
