McqMate

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

1.5k

0

Do you find this helpful?

5

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- 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?
- Kruskal’s algorithm is best suited for the dense graphs than the prim’s algorithm.
- Kruskal’s algorithm is best suited for the sparse graphs than the prim’s algorithm.
- The running time of Bellmann Ford algorithm is lower than that of Dijkstra’s Algorithm.
- Dijikstra’s Algorithm is more efficient than Bellmann Ford Algorithm.