Algorithms | Sorting | Question 23

The number of elements that can be sorted in time using heap sort is

(A) 
(B) 
(C) 
(d)

(A) A (B) B (C) C (D) D
Answer:(C)
Explanation: Time complexity of Heap Sort is for m input elements. For m = , the value of will be which will be which is
Quiz of this Question

Article Tags :

DSA Quiz

Algorithms-Sorting-Quiz

Sorting Quiz

Recommended Articles

1. Algorithms | Sorting | Question 1

2. Algorithms | Sorting | Question 2

3. Algorithms | Sorting | Question 3

4. Algorithms | Sorting | Question 4

5. Algorithms | Sorting | Question 5

6. Algorithms | Sorting | Question 6

7. Algorithms | Sorting | Question 7

8. Algorithms | Sorting | Question 9

9. Algorithms | Sorting | Question 11

10. Algorithms | Sorting | Question 12

11. Algorithms | Sorting | Question 13

12. Algorithms | Sorting | Question 14

13. Algorithms | Sorting | Question 15

14. Algorithms | Sorting | Question 16

15. Algorithms | Sorting | Question 17

16. Algorithms | Sorting | Question 18

17. Algorithms | Sorting | Question 19

18. Algorithms | Sorting | Question 20

19. Algorithms | Sorting | Question 10

20. The Slowest Sorting Algorithms

21. Algorithms | Analysis of Algorithms (Recurrences) | Question 1

22. Algorithms | Analysis of Algorithms (Recurrences) | Question 2

23. Algorithms | Analysis of Algorithms | Question 2

24. Algorithms | Analysis of Algorithms | Question 3

25. Algorithms | Analysis of Algorithms | Question 4