1.

Match the following and select the correct option. algorithm 1 | Prims's algorithm a | Dynamic programming 2 | Binary search b_ | Divide and conquer algorithm programming 3 | Quick sort algorithm |c | Greedy programming 4 | Traveling salesmen d_ | Decrease-and- Conquer programming a) 1-a,2-c,3-d,4-b b) 1-c,2-a,3-b,4-d c) 1-d,2-c,3-a,4-b d) 1-c,2-d,3-b,4-a

Answer» TION:HI good afternoon have a good DAY BYE


Discussion

No Comment Found