Home »
MCQs »
Data Structure and Algorithms (DSA) MCQs
Quick Sort is based on?
15. Quick Sort is based on?
- Divide and Conquer Approach
- Greedy Approach
- Improved Binary Search
- None of the above
Answer
The correct answer is: A) Divide and Conquer Approach
Explanation
Binary Search algorithm uses divide and conquer approach. It divides the collection using a pivot and then sorts the two sub collections recursively.