What is the worst case time complexity of comb sort?
Posted: Wed Jul 13, 2022 6:15 pm
a) O(n2)
b) O(n log n)
c) O(n)
d) O(n2/2a) (a=number of increment)
b) O(n log n)
c) O(n)
d) O(n2/2a) (a=number of increment)
Accurate answers. Every time.
https://answerhappy.com/