This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Permutation Sort”.

1. Which of the following is not an alternative name of permutation sort?

a) stupid sort

b) bogo sort

c) donkey sort

d) monkey sort

View Answer

Explanation: Permutation sort is also known by names like stupid sort, monkey sort, bogo sort, slow sort and shotgun sort. These names are particularly chosen due to its inefficient algorithm.

2. 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

View Answer

Explanation: Permutation sort algorithm successively generates permutations of its input. This process is repeated until the sorted version of the array is found.

3. What is the auxiliary space requirement of permutation sort?

a) O(n)

b) O(1)

c) O(log n)

d) O(n log n)

View Answer

Explanation: Permutation sort algorithm does not require any extra space for sorting the input array. Thus its auxiliary space requirement is O(1).

4. What is the best case time complexity of permutation sort?

a) O(n^{2})

b) O(n)

c) O(n log n)

d) O(1)

View Answer

Explanation: Best case time complexity of permutation sort occurs when the input array is already sorted. So in such a case we only need to check whether all the elements are sorted which can be done in O(n) time.

5. What is the worst case time complexity of permutation sort?

a) O(n^{2})

b) O(n*n!)

c) O(infinity)

d) O(n log n)

View Answer

Explanation: There is no upper bound to the worst case of this algorithm. It can go on to take a very large amount of time if the array has many elements. So the worst case of this algorithm can be taken as O(infinity).

6. Which of the following sorting algorithm is not stable __________

a) insertion sort

b) bubble sort

c) merge sort

d) bogosort

View Answer

Explanation: Out of the given algorithms only bogosort is not stable. This is because it creates permutations of the input array in order to obtain the sorted version. So there is no guarantee that the sorted version obtained by such a method gives a stable output.

7. Which of the following is an in-place sorting algorithm?

a) Merge sort

b) Permutation sort

c) Radix sort

d) Counting sort

View Answer

Explanation: Out of the given algorithms only permutation sort is an in-place sorting algorithm. It is because the permutation sort algorithm does not require any extra space for sorting the input array.

8. Sleep sort should be preferred over permutation sort as it has better time complexity.

a) true

b) false

View Answer

Explanation: If we sort an array using sleep sort then there is no guarantee that the output we get is correctly sorted. So even though sleep sort is better than bogosort in time complexity but it cannot be preferred due to its inaccuracy.

9. What is the average case time complexity of permutation sort?

a) O(n^{2})

b) O(n*n!)

c) O(infinity)

d) O(n log n)

View Answer

Explanation: For calculating the average we first need to calculate the number of possible permutations an array of size n can have. This will be equal to n!. As each permutation also needs to be checked whether it is sorted or not so this takes another n time. Thus overall time complexity becomes O(n*n!).

10. Which of the following code correctly implements the permutation sort algorithm?

a)

bool isSorted(int a[], int n) { while ( --n > 1 ) if (a[n] < a[n-1]) return false; return true; } void shuffle(int a[], int n) { for (int i=0; i < n; i++) swap(a[i], a[rand()%n]); } void bogosort(int a[], int n) { while ( !isSorted(a, n) ) shuffle(a, n); }

b)

bool isSorted(int a[], int n) { while ( --n > 1 ) if (a[n] < a[n-1]) return true; return false; } void shuffle(int a[], int n) { for (int i=0; i < n; i++) swap(a[i], a[rand()%n]); } void bogosort(int a[], int n) { while ( !isSorted(a, n) ) shuffle(a, n); }

c)

bool isSorted(int a[], int n) { while ( --n > 1 ) if (a[n] > a[n-1]) return true; return false; } void shuffle(int a[], int n) { for (int i=0; i < n; i++) swap(a[i], a[rand()%n]); } void bogosort(int a[], int n) { while ( !isSorted(a, n) ) shuffle(a, n); }

d)

bool isSorted(int a[], int n) { while ( --n > 1 ) if (a[n] < a[n-1]) return false; return true; } void shuffle(int a[], int n) { for (int i=0; i < n; i++) swap(a[i], a[rand()%n]); } void bogosort(int a[], int n) { while ( isSorted(a, n) ) shuffle(a, n); }

Explanation: To implement permutation sort algorithm we need to shuffle the input array until we get the sorted array. So we first check whether the array is sorted using function isSorted(). If it is not, then we shuffle it using function shuffle(). This process is repeated until we get a sorted array.

**Sanfoundry Global Education & Learning Series – Data Structures & Algorithms.**

To practice all areas of Data Structures & Algorithms, __here is complete set of 1000+ Multiple Choice Questions and Answers__.