Latest DATA STRUCTURE Aptitude Question SOLUTION: if all the given elements in a array is same then what is the time complexity of the Heap Sort.

• Placement Papers
• /
• DATA STRUCTURE
• /
• Programming
• /
• Technical

DATA STRUCTURE Question Papers:

(#M40034740) DATA STRUCTURE Programming question Heap Sort Keep an EYE

if all the given elements in a array is same then what is the time complexity of the Heap Sort.

Asked In DATA STRUCTURE Rahul Bhadana (10 years ago)

Unsolved Read Solution (10)

Is this Puzzle helpful?   (10)   (1) Submit Your Solution Technical

Read Solution (10) :

Anjali  (10 years ago)

heap sort complexity do not depend upon the type of input in array.
Thus its complexity remains O(nlgn)

Is this solution Helpfull? Yes (11) | No   

Pooja  (9 years ago)

For heap sort we have to construct heap first.And heap construction itself will take O(n logn)even if elements are same because its (Max Heap/ Min Heap)defination states greater or equal and less than or equal respectively. Hence in sorting deletion and swapping occur which take O(n logn ).

Thus ans will remain O(n logn).

Is this solution Helpfull? Yes (4) | No   

Sunil Gajanan Nirmal  (10 years ago)

ans:O(nlogn)
best , worst, avg case=O(nlogn)

Is this solution Helpfull? Yes (1) | No (1)  

arun bhushan  (9 years ago)

time complexity of heap sort is o(nlogn)

Is this solution Helpfull? Yes (1) | No   

barun  (10 years ago)

ans please

Is this solution Helpfull? Yes | No   

sravanthi katta  (9 years ago)

heap sort complexity will be the same whatever the elements in the array is
o(nlog(n))

Is this solution Helpfull? Yes | No   

Coco   (9 years ago)

When all the elements in a array is identical heap sort takes O(n) steps

Is this solution Helpfull? Yes | No   

jyoti pandey  (9 years ago)

its time complexict is nlogn

Is this solution Helpfull? Yes | No   

P.Pandeeswari  (9 years ago)

time complexity is O(n logn)

Is this solution Helpfull? Yes | No   

sumitra jayswal  (9 years ago)

T.C of heap sort-O(nlogn)

Is this solution Helpfull? Yes | No (1)  

Please Login to Read Solution.