MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
| 1. |
What is the average time complexity of MSD radix sort (w= bits required to store each key)? |
| A. | O(n + w) |
| B. | O(n.w) |
| C. | O(n<sup>2</sup>) |
| D. | O(n log n) |
| Answer» C. O(n<sup>2</sup>) | |