Which of the following sorting algorithms does not have a worst case running time of O(n2) ?
A. Insertion sort
B. Merge sort
C. Quick sort
D. Bubble sort
Answer:B
Which of the following sorting algorithms does not have a worst case running time of O(n2) ?
A. Insertion sort B. Merge sort C. Quick sort D. Bubble sort