1. Describe in bullet points the steps involved in the HeapSort algorithm [4 mar...
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
1. Describe in bullet points the steps involved in the HeapSort algorithm [4 marks]2. What is the worst-case time complexity of HeapSort algorithm? Assume the input size N to be the number of elements in the input array. No explanation no marks. [4 marks]3. What are the two invariants of max heaps? Explain what each of these invariants mean. [2 marks]
Want instant access to all verified answers on learning.monash.edu?
Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!