basemax / 0-1knapsackdynamicprogrammingc

This is an implementation of the 0-1 knapsack problem in C using dynamic programming. The problem consists of a set of items, each with a weight and a value, and a knapsack with a maximum weight capacity. The goal is to determine the subset of items that maximizes the total value of the knapsack without exceeding its weight capacity.

Hi 👋, I'm Max

Wanna nominate me as a GitHub Star ? Here you go !!

Welcome !!
Some things about me :
1️⃣ Programming language developer
2️⃣ Full stack developer and IT professional with over 10 years of experience.
3️⃣ Proficient with C, PHP, TypeScript, JavaScript, GO, CSS, and Python.
4️⃣ Have mastered many areas of programming like Web Development and server-side programming.
5️⃣ I’m currently working on the ONE Programming Language
6️⃣ Looking for funds to complete my Compiler Project - One. Support us at GitHub Sponsors or Patreon.
7️⃣ How to reach me : Mail me at
8️⃣ Ask me anything related to programming : here
9️⃣ Fun fact : Have been developing software for most part of my life

Languages and Tools:

Languages Interests: