Analysis of Greedy and Backtracking Algorithm on Knapsack Problem

Abstract

- Greedy and Backtracking approaches are two methods commonly used to solve optimization
problems. Many problems can be solved using these two methods. The Greedy Algorithm is the most
popular method for solving optimization problems. The Backtracking algorithm is an algorithm that applies
DFS (Depth First Search) to its node tracing. Knapsack problem is a combinatorial problem, where a group
of items is given each having a weight and value. Knapsack solution using Greedy does not always get
optimal results while backtracking always achieves optimal results