MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 3 Mcqs, each offering curated multiple-choice questions to sharpen your Insertion Sort Multiple Choice Questions and Answers (MCQs) knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
In insertion sort, the average number of comparisons required to place the 7th element into its correct position is ____ |
| A. | 9 |
| B. | 4 |
| C. | 7 |
| D. | 14 |
| Answer» C. 7 | |
| 2. |
Statement 1: In insertion sort, after m passes through the array, the first m elements are in sorted order. |
| A. | Statement 2: And these elements are the m smallest elements in the array. |
| B. | Both the statements are true |
| C. | Statement 1 is true but statement 2 is false |
| D. | Statement 1 is false but statement 2 is true |
| E. | Both the statements are false |
| Answer» C. Statement 1 is true but statement 2 is false | |
| 3. |
The worst case time complexity of insertion sort is O(n2). What will be the worst case time complexity of insertion sort if the correct position for inserting element is calculated using binary search? |
| A. | O(nlogn) |
| B. | O(n2) |
| C. | O(n) |
| D. | O(logn) |
| Answer» C. O(n) | |