Friday 8 February 2013

27

Which of the following sorting algorithms has average-case and worst-case running time of O (n log n) ?
(A) Bubble sort
(B) Insertion sort
(C) Merge sort
(D) Quick sort.
Join me on Facebook