McqMate

Q. |
## The ____________ is used in an elegant sorting algorithm. |

A. | Heap sort. |

B. | Quick sort. |

C. | Merge sort. |

D. | Radix sort. |

Answer» A. Heap sort. |

3.9k

0

Do you find this helpful?

23

View all MCQs in

Data Structures (DS)No comments yet

- Statement 1: Shell sort is a stable sorting algorithm. Statement 2: Shell sort is an in-place sorting algorithm.
- What is an external sorting algorithm?
- What is an internal sorting algorithm?
- What is an in-place sorting algorithm?
- Which of the following sorting algorithm is stable?
- Which of the following sorting algorithm is of divide-and-conquer type?
- What is an external sorting algorithm?
- The topological sorting of any DAG can be done in time.
- If there are more than 1 topological sorting of a DAG is possible, which of the following is true.
- Which of the following is not an advantage of optimised bubble sort over other sorting techniques in case of sorted elements?