- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Which of the following sorting algorithm...

Q. |
## Which of the following sorting algorithm is NOT stable? |

A. | selection sort |

B. | brick sort |

C. | bubble sort |

D. | merge sort |

Answer» A. selection sort | |

Explanation: out of the given options selection sort is the only algorithm which is not stable. it is because the order of identical elements in sorted output may be different from input array. |

View all MCQs in:
Design and Analysis of Algorithms

- Which of the following sorting algorithm has best case time complexity of O(n2)?
- Can stable marriage cannot be solved using branch and bound algorithm.
- What is the efficiency of Gale-Shapley algorithm used in stable marriage problem?
- Suppose you have coins of denominations 1,3 and 4. You use a greedy algorithm, in which you choose the largest denomination coin which is not greater than the remaining sum. For which of the following sums, will the algorithm produce an optimal answer?
- Which of the following sorting algorithms is the fastest?
- Which of the following sorting algorithms is used along with quick sort to sort the sub arrays?
- Which algorithm is the most efficient numerical algorithm to obtain lcm?
- Is Coppersmith-Winograd algorithm better than Strassen’s algorithm in terms of time complexity?
- The naive pattern searching algorithm is an in place algorithm.
- Rabin Karp algorithm and naive pattern searching algorithm have the same worst case time complexity.

Login to Continue

It will take less than 2 minutes

Report MCQ