MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 9 Mcqs, each offering curated multiple-choice questions to sharpen your Permutation Sort Multiple Choice knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
What is the average case time complexity of permutation sort? |
| A. | O(n<sup>2</sup>) |
| B. | O(n*n!) |
| C. | O(infinity) |
| D. | O(n log n) |
| Answer» C. O(infinity) | |
| 2. |
Sleep sort should be preferred over permutation sort as it has better time complexity. |
| A. | true |
| B. | false |
| Answer» C. | |
| 3. |
Which of the following is an in-place sorting algorithm? |
| A. | Merge sort |
| B. | Permutation sort |
| C. | Radix sort |
| D. | Counting sort |
| Answer» C. Radix sort | |
| 4. |
Which of the following sorting algorithm is not stable __________ |
| A. | insertion sort |
| B. | bubble sort |
| C. | merge sort |
| D. | bogosort |
| Answer» E. | |
| 5. |
What is the worst case time complexity of permutation sort? |
| A. | O(n<sup>2</sup>) |
| B. | O(n*n!) |
| C. | O(infinity) |
| D. | O(n log n) |
| Answer» D. O(n log n) | |
| 6. |
What is the best case time complexity of permutation sort? |
| A. | O(n<sup>2</sup>) |
| B. | O(n) |
| C. | O(n log n) |
| D. | O(1) |
| Answer» C. O(n log n) | |
| 7. |
What is the auxiliary space requirement of permutation sort? |
| A. | O(n) |
| B. | O(1) |
| C. | O(log n) |
| D. | O(n log n) |
| Answer» C. O(log n) | |
| 8. |
Permutation sort works by __________ |
| A. | generating random permutations of its input |
| B. | partitioning the array |
| C. | dividing the value of input elements |
| D. | generating permutations according to the value of first element of array |
| Answer» B. partitioning the array | |
| 9. |
Which of the following is not an alternative name of permutation sort? |
| A. | stupid sort |
| B. | bogo sort |
| C. | donkey sort |
| D. | monkey sort |
| Answer» D. monkey sort | |