{"payload":{"header_redesign_enabled":false,"results":[{"id":"577157607","archived":false,"color":"#555555","followers":1,"has_funding_file":false,"hl_name":"BaseMax/KnapsackProblemC","hl_trunc_description":"This is a simple implementation of the knapsack problem in C in both recursive and dynamic programming approaches.","language":"C","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":577157607,"name":"KnapsackProblemC","owner_id":2658040,"owner_login":"BaseMax","updated_at":"2023-02-03T17:33:14.788Z","has_issues":true}},"sponsorable":false,"topics":["c","algorithm","data-structure","algorithms","dynamic-programming","datastructure","knapsack","algorithms-datastructures","ds","algorithms-and-data-structures"],"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":57,"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%252FKnapsackProblemC%2B%2Blanguage%253AC","metadata":null,"csrf_tokens":{"/BaseMax/KnapsackProblemC/star":{"post":"hvPKdJu1OI9EdEi7YQYteBhXm0tJhprZJthAGFog0MIzwDCogPtO33MGQElp1tDv8x54iLffgj8uHmbfludA7A"},"/BaseMax/KnapsackProblemC/unstar":{"post":"0AHgVBrL-yjEy_h2VRm_ycXLQvOQ9i3bXfgxWKiJe7iHlavYYLp8oI17CsD_7AOQNJoujGSLCtFCoO5fntFMjg"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"cEjlrp9yu0Oz5Ojv2LGMAUSIUOPfB8kP1FYFHID3kRWo-C_Cn5AECOL-bMAJuMNjWZ1vxf55IlCe0VYHBq7YXA"}}},"title":"Repository search results"}