{"id":25171782,"url":"https://github.com/basemax/0-1knapsackgreedyc","last_synced_at":"2025-04-03T21:24:28.180Z","repository":{"id":151535189,"uuid":"588924596","full_name":"BaseMax/0-1KnapsackGreedyC","owner":"BaseMax","description":"This is an implementation of the 0-1 knapsack problem in C using a greedy algorithm. 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-14T14:00:07.000Z","size":18,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-03-28T17:08:04.305Z","etag":null,"topics":["c","greedy","greedy-algorithm","greedy-algorithms","greedy-programming","knapsack","knapsack-01","knapsack-greedy","knapsack-problem","knapsack-problem-greedy","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-14T13:52:57.000Z","updated_at":"2023-02-03T14:30:51.000Z","dependencies_parsed_at":"2023-07-10T13:51:55.434Z","dependency_job_id":null,"html_url":"https://github.com/BaseMax/0-1KnapsackGreedyC","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-1KnapsackGreedyC","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2F0-1KnapsackGreedyC/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2F0-1KnapsackGreedyC/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2F0-1KnapsackGreedyC/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/BaseMax","download_url":"https://codeload.github.com/BaseMax/0-1KnapsackGreedyC/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247080372,"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","greedy","greedy-algorithm","greedy-algorithms","greedy-programming","knapsack","knapsack-01","knapsack-greedy","knapsack-problem","knapsack-problem-greedy","knapsack-solver","knapsack0-1","knapsack01"],"created_at":"2025-02-09T09:22:04.697Z","updated_at":"2025-04-03T21:24:28.170Z","avatar_url":"https://github.com/BaseMax.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":null,"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbasemax%2F0-1knapsackgreedyc","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbasemax%2F0-1knapsackgreedyc","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbasemax%2F0-1knapsackgreedyc/lists"}