Login / Signup

Question

What is the time complexity of Heap Sort in the worst case and what type of heap is used to sort an array in ascending order?

A O(n²) worst case; Min-Heap for ascending order

B O(n log n) worst case; Min-Heap for ascending order

C O(n log n) worst case; Max-Heap for ascending order

D O(n log n) average; O(n²) worst; Max-Heap

E O(log n) worst case; Max-Heap for ascending order

Practice Next

More IT Operating System Questions

A custom stack implementation has a pop() method that is supposed to remove and return the top element. However, when the stack is empty, calling pop() cau...
Which of the following best defines software testing?
int i=10; float f=i; What kind of typecasting is happening in the above scenario?
What is the primary use of the printf function in C/C++ programming?
What is the typical time complexity for inserting an element into a java.util.PriorityQueue with N elements? import java.util.PriorityQueue; ...
Consider: SELECT DEPT, AVG(SALARY) FROM EMP GROUP BY DEPT HAVING AVG(SALARY) > 50000; If EMP has: IT(60k,45k,70k), HR(55k,40k), Finance(80k) — which outpu...
Which algorithm approach focus on Local Optimum solution?
Which of the following members of a superclass are NOT inherited by its subclass?
Which statement is true regarding Inductor and capacitor filter respectively used in the rectifier?
Which of these is a primary benefit of cloud disaster recovery?

Hey! Ask a query

ask-question