# Bogosort Multiple choice Questions and Answers (MCQs)

## Bogosort Multiple choice Questions and Answers (MCQs)

 Question 1
Which of the following is not an alternative name of bogosort?
 A stupid sort B permutation sort C donkey sort D monkey sort
Question 1 Explanation:
Bogosort is also known by names like stupid sort, monkey sort, permutation sort, slow sort and shotgun sort.These names are particularly chosen due to its inefficient algorithm.

 Question 2
Bogosort 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
Question 2 Explanation:
Bogosort algorithm successively generates permutations of its input. This process is repeated until the sorted version of the array is found.

 Question 3
What is the auxiliary space requirement of bogosort?
 A O(n) B O(1) C O(log n) D O(n log n)
Question 3 Explanation:
Bogosort algorithm do not require any extra space for sorting the input array. Thus its auxiliary space requirement is O(1).

 Question 4
What is the best case time complexity of bogosort?
 A O(n2) B O(n) C O(n log n) D O(1)