MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
| 1. |
The upper bound on the time complexity of the nondeterministicsorting algorithm is? |
| A. | O(n) |
| B. | O(n log n) |
| C. | O(1) |
| D. | O( log n) |
| Answer» B. O(n log n) | |