Home
Explore
Places
win7
win8
Coding
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.
27
2013-02-08T07:22:00-08:00
cvs
prgm|