Merge sort -----> iii Divide and conquer
Huffman coding -----> ii Greedy approach
Optimal polygon triangulation -------> i. Dynamic Programming
Subset sum problem -------> iv. Back tracking
just match first 2..
Merge sort is a sorting technique based on divide and conquer technique. With worst-case time complexity being Ο(n log n), it is one of the most respectedalgorithms. Merge sort first divides the array into equal halves and then combines them in a sorted manner.
Greedy algorithm is an algorithm that follows the problem solving mechanism of making the locally optimal solution at each stage with thinking of finding a global optimum solution for the problem and In Huffman coding in every stage we try to find the the prefix free binary code and try to minimize expected code word for optimum solution for compress the data.