MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 12 Mcqs, each offering curated multiple-choice questions to sharpen your Recursive Insertion Sort Multiple Choice knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Which of the following sorting algorithm is in place? |
| A. | recursive insertion sort |
| B. | merge sort |
| C. | radix sort |
| D. | counting sort |
| Answer» B. merge sort | |
| 2. |
Which of the following is an adaptive sorting algorithm? |
| A. | recursive insertion sort |
| B. | merge sort |
| C. | heap sort |
| D. | selection sort |
| Answer» B. merge sort | |
| 3. |
What is the auxiliary space complexity of recursive insertion sort? |
| A. | O(n) |
| B. | O(1) |
| C. | O(n log n) |
| D. | O(n<sup>2</sup>) |
| Answer» C. O(n log n) | |
| 4. |
How many swaps will be required in the worst case to sort an array having n elements using binary insertion sort? |
| A. | n |
| B. | 1 |
| C. | n * log n |
| D. | log n |
| Answer» E. | |
| 5. |
What is the worst case time complexity of recursive insertion sort? |
| A. | O(n) |
| B. | O(n log n) |
| C. | O(n<sup>2</sup>) |
| D. | O(log n) |
| Answer» D. O(log n) | |
| 6. |
What is the best case time complexity of recursive insertion sort? |
| A. | O(n) |
| B. | O(n log n) |
| C. | O(n<sup>2</sup>) |
| D. | O(log n) |
| Answer» B. O(n log n) | |
| 7. |
What is the average case time complexity of recursive insertion sort? |
| A. | O(n) |
| B. | O(n log n) |
| C. | O(n<sup>2</sup>) |
| D. | O(log n) |
| Answer» D. O(log n) | |
| 8. |
Recursive insertion sort is a comparison based sort. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 9. |
Which of the following is a variant of insertion sort? |
| A. | selection sort |
| B. | shell sort |
| C. | odd-even sort |
| D. | stupid sort |
| Answer» C. odd-even sort | |
| 10. |
What will be the recurrence relation of the code of recursive insertion sort? |
| A. | T(n) = 2T(n/2) + n |
| B. | T(n) = 2T(n/2) + c |
| C. | T(n) = T(n-1) + n |
| D. | T(n) = T(n-1) + c |
| Answer» D. T(n) = T(n-1) + c | |
| 11. |
Insertion sort is an online sorting algorithm. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 12. |
Which of the following is an advantage of recursive insertion sort over its iterative version? |
| A. | it has better time complexity |
| B. | it has better space complexity |
| C. | it is easy to implement |
| D. | it has no significant advantage |
| Answer» E. | |