Heap sort is an __________ sorting algorithm.
a) O(1)
b) O(n)
c) O(n log n)
d) O()
e) none of the above
c) O(n log n)
Computer Science & Information Technology
You might also like to view...
What is the citation option commonly used in business reports?
What will be an ideal response?
Computer Science & Information Technology
The notation anArray[____] can always be used to access the last element of anArray.
A. anArray.max-1 B. anArray.max C. anArray.length-1 D. anArray.length
Computer Science & Information Technology