Which of the following algorithm design techniques is used in the quicksort…
20182018
Which of the following algorithm design techniques is used in the quicksort algorithm?
Answer: C. Divide and conquer — Quicksort works by dividing the array around a pivot element into two subarrays and then recursively conquering (sorting) those subarrays. Hence, it follows…
- A.
Dynamic programming
- B.
Backtracking
- C.
Divide and conquer
- D.
Greedy method
Attempted by 1511 students.
Show answer & explanation
Correct answer: C
Quicksort works by dividing the array around a pivot element into two subarrays and then recursively conquering (sorting) those subarrays. Hence, it follows the divide and conquer strategy.
Loading lesson…