## Help authour, Buy PDF Ebook
>>>**Click Here**<<<

## Bogosort Multiple choice Questions and Answers (MCQs)

Question 1 |

Which of the following is not an alternative name of bogosort?

stupid sort | |

permutation sort | |

donkey sort | |

monkey sort |

**History Questions answers**

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

generating random permutations of its input | |

partitioning the array | |

dividing the value of input elements | |

generating permutations according to the value of first element of array |

**Public administration Questions answers**

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?

O(n) | |

O(1) | |

O(log n) | |

O(n log n) |

**Data interpretation (DI) Questions answers**

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?

O(n ^{2}) | |

O(n) | |

O(n log n) | |

O(1) |

**Biology Questions answers**

Question 4 Explanation:

Best case time complexity of bogosort 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.

Question 5 |

What is the worst case time complexity of bogosort?

O(n ^{2}) | |

O(n*n!) | |

O(infinity) | |

O(n log n) |

**NTA NET Questions answers**

Question 5 Explanation:

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

There are 5 questions to complete.