The correct matching for the following pairs is
(A) All pairs shortest path (1) Greedy
(B) Quick Sort (2) Depth-First search
(C) Minimum weight spanning tree (3) Dynamic Programming
(D) Connected Components (4) Divide and and Conquer
Codes:
A B C D
a 2 4 1 3
b 3 4 1 2
c 3 4 2 1
d 4 1 2 3