Question

Which of the following sorting algorithms does not have a worst case running time of O(n2)?

A Insertion sort
B Quick sort
C Bubble sort
D Merge sort
Answer & Explanation
Option: [D]

Your Valuable Comments Please...