{"id":25171786,"url":"https://github.com/basemax/0-1knapsackdynamicprogrammingc","last_synced_at":"2025-04-03T21:24:29.117Z","repository":{"id":151535188,"uuid":"588862824","full_name":"BaseMax/0-1KnapsackDynamicProgrammingC","owner":"BaseMax","description":"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.","archived":false,"fork":false,"pushed_at":"2023-01-14T13:50:44.000Z","size":25,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-03-28T17:08:04.349Z","etag":null,"topics":["c","knapsack","knapsack-problem","knapsack-problem-dynamic","knapsack-solution","knapsack-solver","knapsack0-1","knapsack01"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/BaseMax.png","metadata":{},"created_at":"2023-01-14T09:21:25.000Z","updated_at":"2025-03-09T02:15:49.000Z","dependencies_parsed_at":"2023-07-10T13:51:18.562Z","dependency_job_id":null,"html_url":"https://github.com/BaseMax/0-1KnapsackDynamicProgrammingC","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2F0-1KnapsackDynamicProgrammingC","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2F0-1KnapsackDynamicProgrammingC/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2F0-1KnapsackDynamicProgrammingC/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2F0-1KnapsackDynamicProgrammingC/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/BaseMax","download_url":"https://codeload.github.com/BaseMax/0-1KnapsackDynamicProgrammingC/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247080380,"owners_count":20880254,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["c","knapsack","knapsack-problem","knapsack-problem-dynamic","knapsack-solution","knapsack-solver","knapsack0-1","knapsack01"],"created_at":"2025-02-09T09:22:05.018Z","updated_at":"2025-04-03T21:24:29.111Z","avatar_url":"https://github.com/BaseMax.png","language":"C","readme":null,"funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbasemax%2F0-1knapsackdynamicprogrammingc","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbasemax%2F0-1knapsackdynamicprogrammingc","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbasemax%2F0-1knapsackdynamicprogrammingc/lists"}