Heapsort Quiz


Heapsort Quiz

Question 1
What is the average case performance, expressed in Big-O notation, of the Heapsort algorithm?
A
O(n^2)
B
O(n log n)
C
O(n)
D
O(1)
E
O(n!)
Question 2
What is the worst case performance, expressed in Big-O notation, of the Heapsort algorithm?
A
O(n^2)
B
O(n log n)
C
O(n)
D
O(1)
E
O(n!)
Question 3
What is the best case performance, expressed in Big-O notation, of the Heapsort algorithm?
A
O(n^2)
B
O(n log n)
C
O(n)
D
O(1)
E
O(n!)
There are 3 questions to complete.
List
Return
Shaded items are complete.
123
Return