Data Structure (DS) MCQ: What is the worst-case time for heap sort to sort an array of n elements?

What is the worst-case time for heap sort to sort an array of n elements?

Correct Answer: O(n log n).

Make the most of this question

This page focuses on one Data Structure (DS) question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

← More Data Structure (DS) MCQs All Engineering topics Mock test hub

WhatsApp+91 99922 70404Data Structure (DS) MCQ: What is the worst-case time for heap sort to sort an array of n elements? | Extra Education