{"payload":{"header_redesign_enabled":false,"results":[{"id":"588924596","archived":false,"color":"#555555","followers":0,"has_funding_file":false,"hl_name":"BaseMax/0-1KnapsackGreedyC","hl_trunc_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 …","language":"C","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":588924596,"name":"0-1KnapsackGreedyC","owner_id":2658040,"owner_login":"BaseMax","updated_at":"2023-01-14T14:00:07.794Z","has_issues":true}},"sponsorable":false,"topics":["c","greedy","greedy-algorithms","knapsack-problem","greedy-algorithm","knapsack","greedy-programming","knapsack-solver","knapsack01","knapsack-problem-greedy","knapsack0-1","knapsack-01","knapsack-greedy"],"type":"Public","help_wanted_issues_count":0,"good_first_issue_issues_count":0,"starred_by_current_user":false}],"type":"repositories","page":1,"page_count":1,"elapsed_millis":106,"errors":[],"result_count":1,"facets":[],"protected_org_logins":[],"topics":null,"query_id":"","logged_in":false,"sign_up_path":"/signup?source=code_search_results","sign_in_path":"/login?return_to=https%3A%2F%2Fgithub.com%2Fsearch%3Fq%3Drepo%253ABaseMax%252F0-1KnapsackGreedyC%2B%2Blanguage%253AC","metadata":null,"warn_limited_results":false,"csrf_tokens":{"/BaseMax/0-1KnapsackGreedyC/star":{"post":"86lg7cp9w7zO_yGCyq76L5NFhmR7cMHXLCuoMs7WrZQ35oFIBgGDNAtQ9BiVa56rGfx2n8Lp5KmCLOC89wb4Hw"},"/BaseMax/0-1KnapsackGreedyC/unstar":{"post":"WEWL-3P8Sie7I_kQyGIdFj_kNedAES6aGWtdhey4DjOBM6t47QoRCrOlBs0RYjC_jY2p2mPECLa81cdnDDUZ8Q"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"u3jbS7SMo_4amuPun-Cq858A1rDGmGsvsGnX2RmU7amKLfRg4TYbTZjcRiUWgTAIXxuwuMtGVGfSds29iy3d4Q"}}},"title":"Repository search results"}