The number of elements that can be sorted in 
time using heap sort is
(A)(B)
(C)
(d)
(B) 
(C) 
(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 ![\Theta( [Log n/(Log Log n)] * [Log (Log n/(Log Log n))] )](https://neveropen.co.za/wp-content/uploads/2023/10/wardslaus_quicklatex.com-ede2953d40cb46034f23eb472654ba27_l3.png "Rendered by QuickLaTeX.com")
which will be ![\Theta( [Log n/(Log Log n)] * [ Log Log n - Log Log Log n] )](https://neveropen.co.za/wp-content/uploads/2023/10/dominic_rubhabha_quicklatex.com-c12e38119daa51b24cce14756f4e9dbc_l3.png "Rendered by QuickLaTeX.com")
which is 
Whether you’re preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape, neveropen Courses are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we’ve already empowered, and we’re here to do the same for you. Don’t miss out – check it out now!