1
Prims's algorithm
a
Dynamic
programming
2.
b
Binary search
algorithm
Divide and conquer
programming
3
Quick sort algorithm
с
Greedy programming
4.
d
Traveling salesmen
algorithm
Decrease-and-
Conquer
programming
Answers
Answered by
0
Answer:
a is the correct answer
Answered by
1
Answer:
a) Dynamic programming
Similar questions