Skip to content

Knapsack problem dynamic programming approach missing #9402

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom
Closed
kbadal19 opened this issue Oct 2, 2023 · 2 comments
Closed

Knapsack problem dynamic programming approach missing #9402

kbadal19 opened this issue Oct 2, 2023 · 2 comments
Labels
awaiting triage Awaiting triage from a maintainer

Comments

@kbadal19
Copy link

kbadal19 commented Oct 2, 2023 •
edited
Loading

What would you like to share?

The knapsack problem using the dynamic programming approach is not solved. Instead, only naive recursive methodology and greedy methods are used. I would like to implement the Dynamic Programming approach which is faster and more efficient.

Additional information

No response
@kbadal19 kbadal19 added the awaiting triage Awaiting triage from a maintainer label Oct 2, 2023
@kbadal19 kbadal19 closed this as completed Oct 2, 2023
@kbadal19 kbadal19 reopened this Oct 2, 2023
@Jiang15
Copy link
Contributor

Jiang15 commented Oct 2, 2023

Hi, I have implemented with dp and the PR is here: #9295

@tianyizheng02
Copy link
Contributor

The knapsack problem using the dynamic programming approach is not solved.

... Did you check the dynamic_programming/ directory? dynamic_programming/knapsack.py

@tianyizheng02 tianyizheng02 closed this as not planned Won't fix, can't repro, duplicate, stale Oct 2, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
awaiting triage Awaiting triage from a maintainer
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
3 participants
@Jiang15 @tianyizheng02 @kbadal19