Q277
What is the worst case time complexity of comb sort?
A.
O(n2)
AnswerB.
O(n log n)
C.
O(n)
D.
O(n2/2a) (a=number of increment)
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board