1.

What will be the best case time complexity of recursive selection sort?

A. O(n)
B. O(n2)
C. O(log n)
D. O(n log n)
Answer» C. O(log n)


Discussion

No Comment Found