Bissoy.com
Doctors Medicines MCQs Q&A

Which of the following sorting algorithm is not stable __________

Which of the following sorting algorithm is not stable __________ Correct Answer bogosort

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.

Related Questions

Statement 1: Shell sort is a stable sorting algorithm. Statement 2: Shell sort is an in-place sorting algorithm.
Introsort begins sorting the given array by using which of the following sorting algorithm?
Tim sort begins sorting the given array by using which of the following sorting algorithm?
which of the following is not a stable sorting algorithm in its typical implementation?
Which of the following is not a stable sorting algorithm?
Which of the following sorting algorithm is NOT stable?
Which of the following statement is not a stable sorting algorithm?
Which of the following is not necessarily a stable sorting algorithm?
The transfer function of a discrete time LTI system is given by
$$H\left( z \right) = {{2 - {3 \over 4}{z^{ - 1}}} \over {1 - {3 \over 4}{z^{ - 1}} + {1 \over 8}{z^{ - 2}}}}$$
Consider the following statements:
S1 : The system is stable and causal for
$$ROC:\left| z \right| > {1 \over 2}$$
S2 : The system is stable but not causal for
$$ROC:\left| z \right| S3 : The system is neither stable nor causal for
$$ROC:{1 \over 4} Which one of the following statements is valid?
Which of the following sorting algorithm is stable?