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
Last Updated :
28 Jun, 2021
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...