McqMate

Q. |
## Which of the following sorting algorithms is the fastest? |

A. | merge sort |

B. | quick sort |

C. | insertion sort |

D. | shell sort |

Answer» B. quick sort | |

Explanation: quick sort is the fastest known sorting algorithm because of its highly optimized inner loop. |

836

0

Do you find this helpful?

4

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- Which of the following sorting algorithms is used along with quick sort to sort the sub arrays?
- Which of the following sorting algorithm has best case time complexity of O(n2)?
- Which of the following sorting algorithm is NOT stable?
- Which of the following algorithms is similar to a quickhull algorithm?
- Which of the following algorithms is the simplest?
- Which of the following algorithms does Stable marriage problem uses?
- The running time of Chan’s algorithm is obtained from combining two algorithms.
- is the class of decision problems that can be solved by non- deterministic polynomial algorithms?
- 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 strategies does the following diagram depict?