## Algorithms

Question 1 |

P-iii, Q-ii, R-iv, S-i
| |

P-i, Q-ii, R-iv, S-iii
| |

P-ii, Q-iii, R-iv, S-i | |

P-ii, Q-i, R-iii, S-iv |

Question 1 Explanation:

Primâ€™s algorithm always select minimum distance between two of its sets which is nothing but greedy method.

Floyd-warshall always changes it distance at each iteration which is nothing but dynamic programming.

Merge sort in merge sort first we always divide and merge to perform sorting hence divide and conquer.

Hamiltonian circuit used to reach the entire vertex once, if some vertex is repeating in its path it will backtrack.

Floyd-warshall always changes it distance at each iteration which is nothing but dynamic programming.

Merge sort in merge sort first we always divide and merge to perform sorting hence divide and conquer.

Hamiltonian circuit used to reach the entire vertex once, if some vertex is repeating in its path it will backtrack.

There is 1 question to complete.