Register

Heap Sort

• edited by
643 views

3 Answers

Best answer
2 votes
2 votes

To Sort x Elements Heap Sort takes xlogx time...

So Lets us assume we have Log n/Log Log n elements..

Substitute this in place of x and we get Time Complexity as O(logn)

So The Correct Answer Is Option C)
 

• selected by
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1.2k
views
3 answers
1 votes
rahul sharma 5 asked Nov 27, 2017
1,155 views
[Algorithms] Heap sort
Merging k sorted lists of size n/k into one sorted list of n-elements using heap sort will take how much time ?My doubtFirst approach:- here it is mentioned heap sort so,...
User Avatar
1.0k
views
1 answers
1 votes
reena_kandari asked Jul 30, 2016
1,003 views
heap sort
The number of elements that can be sorted in time using heap sort ?
User Avatar
541
views
0 answers
1 votes
Joon asked Jul 18, 2016
541 views
Heap Sort
Why is the space complexity of heap sort O(1) and not O(log n) even if Heap sort internally calls max_heapify whose space complexity is O(log n) due to the stack (recursi...
User Avatar
1.1k
views
0 answers
1 votes
OneZero asked Dec 24, 2018
1,120 views
Ace Test Series: Algorithm - Heap Sort
Q : What is the running time of heap sort for presorted input of size n?O(n) B) O(n^2) C) O(nlogn) D) O(logn)In the question t...
User Avatar
Link Copied!