# Gnome Sort Multiple choice Questions and Answers (MCQs)

## Gnome Sort Multiple choice Questions and Answers (MCQs)

 Question 1
Gnome sort is also called .....
 A Smart sort B Stupid sort C Bogo sort D Special sort
Question 1 Explanation:
Gnome sort was originally named as stupid sort but later on it got renamed as gnome sort.

 Question 2
How many loops are required to implement gnome sorting algorithm?
 A Single loop B 2 nested loops C 3 nested loops D It does not require any loop
Question 2 Explanation:
In this sorting algorithm the variable representing the index number is not incremented in case the adjacent pair of elements are out of place. In such a case its value is decremented instead. Thus it is able to implement sorting using a single loop.

 Question 3
Which of the following pair of sorting algorithms are stable?
 A gnome sort and quick sort B merge sort and selection sort C gnome sort and merge sort D heap sort and merge sort
Question 3 Explanation:
Gnome sort and merge sort are stable sorting algorithms as the elements with identical values appear in the same order in the output array as they were in the input array when any of these sorting algorithms are implemented.

 Question 4
Auxiliary space used by gnome sort is .....
 A O(1) B O(n) C O(log n) D O(n log n)