Multiple Choice
The heapsort is ______ in the average case.
A) O(1)
B) O(n)
C) O(log n)
D) O(n * log n)
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q32: In a binary search tree implementation of
Q33: The ADT table is position-oriented.
Q34: In a heap,the search keys of the
Q35: What is a semiheap?
Q36: A heap in which the root contains
Q38: What does the priority value in a
Q39: In the Java Collections Framework,what is the
Q40: What are the four categories of linear
Q41: In an unsorted array-based implementation of the
Q42: Which of the following is true about