MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
| 1. |
What is the best case time complexity of bead sort (S = sum of input elements)? |
| A. | O(n) |
| B. | O(S) |
| C. | O(n<sup>2</sup>) |
| D. | O(n log n) |
| Answer» B. O(S) | |