{"payload":{"header_redesign_enabled":false,"results":[{"id":"420558565","archived":false,"color":"#3572A5","followers":0,"has_funding_file":false,"hl_name":"Otniel113/PadovanSequence_DP","hl_trunc_description":"Membandingkan kompleksitas waktu Padovan Sequence secara Rekursif dan Dynamic Programming (DP)","language":"Python","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":420558565,"name":"PadovanSequence_DP","owner_id":57952404,"owner_login":"Otniel113","updated_at":"2022-01-05T09:13:33.724Z","has_issues":true}},"sponsorable":false,"topics":["dynamic-programming","recursive-algorithm","algorithm-complexity"],"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":56,"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%253AOtniel113%252FPadovanSequence_DP%2B%2Blanguage%253APython","metadata":null,"csrf_tokens":{"/Otniel113/PadovanSequence_DP/star":{"post":"GYZ16_29Uzr6hDg5oIwdQ4hpS-NDT90XP0gX25f9BIG8t8_oVCXxxQdaQ5dCxXhzs5yUcGTdsfLb2g012QMZRg"},"/Otniel113/PadovanSequence_DP/unstar":{"post":"PyX-x_BEKWUXBYqQgAFNd7wnarUOuT7u9WNr7kHN0aEXwJPC1J-o2is8ipAAhm0i10X9EK77JPfs3eQvXAxvyA"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"oDHQ2noTAjBcQTG4rzVAQc6ZOvVKssInwNJ078uR9EfohhuWzp6QuZtF1sBRINS6_iZ8Z5LWQb-Ie4AiS01xkw"}}},"title":"Repository search results"}