Knapsack Problem using Greedy Method Algorithm Design Techniques Divide and Conquer Greedy Method Dynamic Programming Back Tracing Branch and Bound Divide and Conquer: Many algorithms are recursive in structure. To solve any problem, they call themselves recursively again and again [one or more times]. Three steps are followed by divide and conquer algorithms. 1.) Divide the problem into the number of sub-problems. 2.) Conquer the sub-problems by solving them recursively. 3.) Combine the solution to the sub-problems into the solution for the original problem. The greedy method is the Straight design technique. It can be applied to a wide variety of problems. Obtain a subset that satisfies the same constraints. Feasible Solution: If any subset satisfies these constraints. Our GOAL: Find a feasible solution that either Maximize or Minimize the given Objective Function. A feasible solution that does this is known as OPTIMAL SOLUTION. A feasible Solution is any subset that satisfie
