Q456
What is the best case time complexity of comb sort and bubble sort respectively?
A.
O(n2) and O(n log n)
B.
O(n log n) and O(n)
AnswerC.
O(n) and O(n2)
D.
O(n2/2a) (a=number of increment) and O(n2)
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board