MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
| 1. |
What is the worst case time complexity of comb sort? |
| A. | O(n<sup>2</sup>) |
| B. | O(n log n) |
| C. | O(n) |
| D. | O(n<sup>2</sup>/2<sup>a</sup>) (a=number of increment) |
| Answer» B. O(n log n) | |