- Computer Science Engineering (CSE)
- Data Structures (DS)
- Which of the following sorting algorithm...

Q. |
## Which of the following sorting algorithm is of divide-and-conquer type? |

A. | Bubble sort. |

B. | Insertion sort. |

C. | Quick sort. |

D. | Algorithm. |

Answer» C. Quick sort. |

View all MCQs in:
Data Structures (DS)

- Statement 1: Shell sort is a stable sorting algorithm. Statement 2: Shell sort is an in-place sorting algorithm.
- Which of the following sorting algorithm is stable?
- What is an external sorting algorithm?
- What is an internal sorting algorithm?
- What is an in-place sorting algorithm?
- What is an external sorting algorithm?
- The ____________ is used in an elegant sorting algorithm.
- 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?
- The topological sorting of any DAG can be done in time.

Login to Continue

It will take less than 2 minutes

Report MCQ