MCQOPTIONS
Saved Bookmarks
| 1. |
Which of the following is TRUE of the time complexity of the insertion sort algorithm to sort a list of ‘n’ integers? |
| A. | Ω (n2) |
| B. | Ω (n) |
| C. | O(n) |
| D. | O(n log (n)) |
| Answer» C. O(n) | |