Which of the following algorithm does NOT use divide-and-conquer strategy?
2021
Which of the following algorithm does NOT use divide-and-conquer strategy?
Answer: D. Travelling Salesperson Problem (TSP) — Correct answer: Travelling Salesperson Problem (TSP) does NOT use divide-and-conquer. Merge sort — uses divide-and-conquer: split the array into halves, sort…
- A.
Merge sort
- B.
Quick sort
- C.
Binary sort and Stressian Multiplication
- D.
Travelling Salesperson Problem (TSP)
Attempted by 63 students.
Show answer & explanation
Correct answer: D
Correct answer: Travelling Salesperson Problem (TSP) does NOT use divide-and-conquer. Merge sort — uses divide-and-conquer: split the array into halves, sort each half recursively, then merge the sorted halves.
Loading lesson…