{"payload":{"header_redesign_enabled":false,"results":[{"id":"606286059","archived":false,"color":"#3572A5","followers":0,"has_funding_file":false,"hl_name":"kennypanjaitan/Closest-Pair-of-Points","hl_trunc_description":"Finding Closest Pair of Points in Multi-Dimensional Space using Divide and Conquer Algorithm","language":"Python","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":606286059,"name":"Closest-Pair-of-Points","owner_id":66663522,"owner_login":"kennypanjaitan","updated_at":"2023-03-01T05:59:08.486Z","has_issues":true}},"sponsorable":false,"topics":["multi-dimensional","divide-and-conquer","closest-pair-of-points"],"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":80,"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%253Akennypanjaitan%252FClosest-Pair-of-Points%2B%2Blanguage%253APython","metadata":null,"warn_limited_results":false,"csrf_tokens":{"/kennypanjaitan/Closest-Pair-of-Points/star":{"post":"NWn9hpZ0HZwDsd0SwY_duy4TeiWUm3owO5lYEcL_2j6cZIWOGozSeGkl6ZdpabdOwGAaf3HAJhZHXXUnzVhcjQ"},"/kennypanjaitan/Closest-Pair-of-Points/unstar":{"post":"0c5Zh4o_l9XP_gQm8zYCBWUQ3q-xlGiRSP12RgPv3tVWn1j7XGqjr2yE6EUh_K4Bn1JpAXDE68J3mIYuQ8kAIg"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"ykoawCro7U_5_MBHif6h-2jBNHEBWAYoO_kfJcmGlip5Mx8uZso3BBXQFqanoGSsVia8nD2L5kPod1O1xeuuhg"}}},"title":"Repository search results"}