Mistakes about 01knapsack

[Kd-Here]

I would loved to help you in that.
Which are your future algo

[BaseMax]

• Dynamic Programming is a general-purpose algorithm that is guaranteed to find the optimal solution in polynomial time, but it can be slow for larger problem sizes.
• Divide and Conquer is a faster alternative to Dynamic Programming, but it may not always give the optimal solution.
• Greedy Algorithm is a fast and simple algorithm that gives a good approximation of the optimal solution, but it may not always give the exact solution.
• Branch and Bound algorithms, including First Depth, First Breadth, and First Best, can be more efficient than Dynamic Programming in certain cases, but they may also be slower in others.

Thank you so much for your message. I think the Greedy Algorithm and Branch and Bound algorithms need to be checked.

There are one solution for Greedy and 3 different algorithms for Branch and Bound (First Depth, First Breadth, and First Best).
I am not sure about the implementation of these, it will be great if you can check, debug and fix these.
Thank you again in advance.

Also please add your name to the README after this update.

[BaseMax]

No update? @Kd-Here