Brute force is a very general problem-solving technique that consists of systematically listing all the possible values that could represent a solution and check whether each value satisfies the conditions imposed by the problem.
A brute-force algorithm is simple to implement, and will always find a solution if it exists, but its cost is proportional to the number of possible solutions. Therefore, brute-force research is typically used when the size of the problem is limited or when hypotheses are available that allow us to reduce the set of possible solutions. The method is also used when the simplicity of implementation is more important than speed.
Brute force is the most immediate solution to the knapsack problem: examine ...
