[PR #984] [CLOSED] feat: knapsack algorithm #1522

New Issue

claunia · 2026-01-29T15:21:54Z

claunia commented

2026-01-29 15:21:54 +00:00

📋 Pull Request Information

Original PR: https://github.com/TheAlgorithms/C/pull/984
Author: @whoisdinanath
Created: 10/3/2022
Status: ❌ Closed

Base: master ← Head: master

📝 Commits (1)

035ddca feat: knapsack algorithm

📊 Changes

1 file changed (+35 additions, -0 deletions)

View changed files

➕ greedy_approach/knapsack.c (+35 -0)

📄 Description

Description of Change

The Knapsack Problem is also called as rucksack problem. A basic C program is written to solve knapsack problem given with set of items each with a mass and value. Describe every individual item included in a collection so that total weight is less than or equal to a given limit and total value is as large as possible. A fixed size knapsack is defined at the beginning. It must fill with most valuable items.

References

Checklist

Added description of change
Added file name matches File name guidelines
Added tests and example, test must pass
Relevant documentation/comments is changed or added
PR title follows semantic commit guidelines
Search previous suggestions before making a new one, as yours may be a duplicate.
I acknowledge that all my contributions will be made under the project's license.

Notes:

_{🔄 This issue represents a GitHub Pull Request. It cannot be merged through Gitea due to API limitations.}

## 📋 Pull Request Information **Original PR:** https://github.com/TheAlgorithms/C/pull/984 **Author:** [@whoisdinanath](https://github.com/whoisdinanath) **Created:** 10/3/2022 **Status:** ❌ Closed **Base:** `master` ← **Head:** `master` --- ### 📝 Commits (1) - [`035ddca`](https://github.com/TheAlgorithms/C/commit/035ddca67e2747bd0a08575b235014b42af3528a) feat: knapsack algorithm ### 📊 Changes **1 file changed** (+35 additions, -0 deletions) <details> <summary>View changed files</summary> ➕ `greedy_approach/knapsack.c` (+35 -0) </details> ### 📄 Description #### Description of Change The Knapsack Problem is also called as rucksack problem. A basic C program is written to solve knapsack problem given with set of items each with a mass and value. Describe every individual item included in a collection so that total weight is less than or equal to a given limit and total value is as large as possible. A fixed size knapsack is defined at the beginning. It must fill with most valuable items.  #### References  #### Checklist  - [x] Added description of change - [x] Added file name matches [File name guidelines](https://github.com/TheAlgorithms/C/blob/master/CONTRIBUTING.md#File-Name-guidelines) - [x] Added tests and example, test must pass - [x] Relevant documentation/comments is changed or added - [x] PR title follows semantic [commit guidelines](https://github.com/TheAlgorithms/C/blob/master/CONTRIBUTING.md#Commit-Guidelines) - [x] Search previous suggestions before making a new one, as yours may be a duplicate. - [x] I acknowledge that all my contributions will be made under the project's license. Notes:  --- <sub>🔄 This issue represents a GitHub Pull Request. It cannot be merged through Gitea due to API limitations.</sub>

claunia added the pull-request label 2026-01-29 15:21:54 +00:00

claunia referenced this issue

2026-01-29 15:29:15 +00:00

[PR #1522] [CLOSED] Refactor binary search tree code and comments #2130

claunia referenced this issue

2026-01-29 15:29:18 +00:00

[PR #1522] Refactor binary search tree code and comments #2135

Sign in to join this conversation.