{"id":25171545,"url":"https://github.com/basemax/knapsackproblemc","last_synced_at":"2025-07-27T06:38:21.018Z","repository":{"id":151535419,"uuid":"577157607","full_name":"BaseMax/KnapsackProblemC","owner":"BaseMax","description":"This is a simple implementation of the knapsack problem in C in both recursive and dynamic programming approaches.","archived":false,"fork":false,"pushed_at":"2023-02-03T17:33:14.000Z","size":47,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-03-28T17:08:06.938Z","etag":null,"topics":["algorithm","algorithms","algorithms-and-data-structures","algorithms-datastructures","c","data-structure","datastructure","ds","dynamic-programming","knapsack"],"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":"2022-12-12T05:06:43.000Z","updated_at":"2023-02-03T19:41:05.000Z","dependencies_parsed_at":null,"dependency_job_id":"f6428fb9-e238-42d5-b2b7-343702f7764b","html_url":"https://github.com/BaseMax/KnapsackProblemC","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%2FKnapsackProblemC","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2FKnapsackProblemC/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2FKnapsackProblemC/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2FKnapsackProblemC/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/BaseMax","download_url":"https://codeload.github.com/BaseMax/KnapsackProblemC/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247079310,"owners_count":20880030,"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":["algorithm","algorithms","algorithms-and-data-structures","algorithms-datastructures","c","data-structure","datastructure","ds","dynamic-programming","knapsack"],"created_at":"2025-02-09T09:21:04.549Z","updated_at":"2025-04-03T21:22:05.364Z","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%2Fknapsackproblemc","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbasemax%2Fknapsackproblemc","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbasemax%2Fknapsackproblemc/lists"}