Heapsort Quiz
Question 1 |
What is the average case performance, expressed in Big-O notation, of the Heapsort algorithm?
O(n^2) | |
O(n log n) | |
O(n) | |
O(1) | |
O(n!) |
Question 2 |
What is the worst case performance, expressed in Big-O notation, of the Heapsort algorithm?
O(n^2) | |
O(n log n) | |
O(n) | |
O(1) | |
O(n!) |
Question 3 |
What is the best case performance, expressed in Big-O notation, of the Heapsort algorithm?
O(n^2) | |
O(n log n) | |
O(n) | |
O(1) | |
O(n!) |
There are 3 questions to complete.
List |