MCQOPTIONS
Saved Bookmarks
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. |
For the following question, how will the array elements look like after second pass? |
| A. | 34, 8, 64, 51, 32, 21 |
| B. | 8, 21, 32, 34, 51, 64 |
| C. | 8, 32, 34, 51, 64, 21 |
| D. | 8, 34, 51, 64, 32, 21 |
| E. | 8, 34, 64, 51, 32, 21 |
| Answer» E. 8, 34, 64, 51, 32, 21 | |
| 2. |
What will be the number of passes to sort the elements using insertion sort? |
| A. | 14, 12,16, 6, 3, 10 |
| B. | 6 |
| C. | 5 |
| D. | 7 |
| E. | 1 |
| Answer» C. 5 | |
| 3. |
Any algorithm that sorts by exchanging adjacent elements require O(N2) on average. |
| A. | True |
| B. | False |
| Answer» B. False | |