1.

What is the best case time complexity of comb sort and bubble sort respectively?

A. O(n<sup>2</sup>) and O(n log n)
B. O(n log n) and O(n)
C. O(n) and O(n<sup>2</sup>)
D. O(n<sup>2</sup>/2<sup>a</sup>) (a=number of increment) and O(n<sup>2</sup>)
Answer» C. O(n) and O(n<sup>2</sup>)


Discussion

No Comment Found