Skip to content
Ravnary
A Knowledge Platform
Categories
Learn
Cheatsheets
Paths
Favourites
Review
Community
Colour theme
Light
Dark
System
Learn
Algorithms
Efficient Sorting
Heapsort
Quiz
Q 01
/ 03
Intermediate
Question 1 of 3. 0 correct, 0 incorrect.
Which of these are true of heapsort on an array of n items? Select every one that applies.
It takes O(n) time on input that is already sorted
It uses O(1) extra space
It is not stable
It is stable
It takes O(n log n) time in the worst case
Check answer
Home
Learn
Paths
Saved
Community