{"payload":{"header_redesign_enabled":false,"results":[{"id":"375344326","archived":false,"color":"#3572A5","followers":0,"has_funding_file":false,"hl_name":"Otniel113/TugasBesarSA","hl_trunc_description":"Membandingkan 2 strategi algoritma : Brute Force (implementasi SelectionSort) dan Divide and Conquer (MergeSort)","language":"Python","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":375344326,"name":"TugasBesarSA","owner_id":57952404,"owner_login":"Otniel113","updated_at":"2022-01-09T01:23:53.246Z","has_issues":true}},"sponsorable":false,"topics":["selection-sort","brute-force","divide-and-conquer","merge-sort","algorithm-complexity","human-development-index"],"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":79,"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%252FTugasBesarSA%2B%2Blanguage%253APython","metadata":null,"warn_limited_results":false,"csrf_tokens":{"/Otniel113/TugasBesarSA/star":{"post":"d5HB07VUBqYBzXkmjnHdaQz68rs5Jhjk49CnBMXY0gvOHySRSSlfLhCzUcHhNG3wIU7Lgap-1Q6euOJQxCMEuw"},"/Otniel113/TugasBesarSA/unstar":{"post":"MHnbS4a5P4KqiImFmGLC4fmFEeXzmYxDMw63QsQMeMCbLcq-c6BlMluwwyV9c_xc8YkDwImKgYynld3efa8zeA"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"RrP3HBRtG19tmNOt9hP3I6Jd_bi6nDwXTwsC4AUXw40f0P-K882tLGCY9__uepPF6CiDGZHugSq_OAVIKD55Ag"}}},"title":"Repository search results"}