1.

What is the worst-case time complexity of the Heap sort?1). O(n log n)2). $O(n^{2})$3). $O(n^{2})$4). 0(n)

Answer»


Discussion

No Comment Found

Related InterviewSolutions