Question

Which of the following sorting algorithms has the best

worst-case time complexity of O(n log n)?

A Quick Sort

B Bubble Sort

C Insertion Sort

D Heap Sort

E Selection Sort

Practice Next

More IT Operating System Questions

Solution