MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
| 1. |
The worst case complexity for insertion sort is |
| A. | O(n) |
| B. | O(log n) |
| C. | O(n<sup>2</sup>) |
| D. | O(n log n) |
| Answer» D. O(n log n) | |