Quicksort algorithm is based on which algorithm design technique?
2021
Quicksort algorithm is based on which algorithm design technique?
Answer: C. Divide and Conquer — Quicksort uses the Divide and Conquer technique. It works by selecting a pivot element and partitioning the array into two subarrays: one with elements less…
- A.
Greedy Algorithm
- B.
Brute Force
- C.
Divide and Conquer
- D.
Dynamic Programming
Attempted by 1690 students.
Show answer & explanation
Correct answer: C
Quicksort uses the Divide and Conquer technique. It works by selecting a pivot element and partitioning the array into two subarrays: one with elements less than the pivot and one with elements greater than the pivot. This process is applied recursively to each subarray until the entire array is sorted.
Loading lesson…