- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Quick sort follows Divide-and-Conquer st...

Q. |
## Quick sort follows Divide-and-Conquer strategy. |

A. | true |

B. | false |

Answer» A. true | |

Explanation: in quick sort, the array is divided into sub-arrays and then it is sorted (divide-and-conquer strategy). |

View all MCQs in:
Design and Analysis of Algorithms

- Which of the following sorting algorithms is used along with quick sort to sort the sub arrays?
- What is the worst case time complexity of a quick sort algorithm?
- What is the average running time of a quick sort algorithm?
- Quick sort uses join operation rather than merge operation.
- How many sub arrays does the quick sort algorithm divide the entire array into?
- Recursive selection sort is a comparison based sort.
- What is the number of swaps required to sort the array arr={5,3,2,4,1} using recursive selection sort?
- What is the other name for quick hull problem?
- How many approaches can be applied to solve quick hull problem?
- What is the average case complexity of a quick hull algorithm?

Login to Continue

It will take less than 2 minutes

Report MCQ