{"payload":{"header_redesign_enabled":false,"results":[{"id":"303537578","archived":false,"color":"#3572A5","followers":0,"has_funding_file":false,"hl_name":"SlavkoPrytula/Find-The-Closest-Pair-Of-Points","hl_trunc_description":"Given an array consisting of n distinct points[p1[x1, y1] ... pn[xn, yn]]. Find the closest pair of points using a Divide-and-Conquer Alg…","language":"Python","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":303537578,"name":"Find-The-Closest-Pair-Of-Points","owner_id":25413268,"owner_login":"SlavkoPrytula","updated_at":"2020-10-14T14:40:06.249Z","has_issues":true}},"sponsorable":false,"topics":["algorithms","minimal","distance","triangle","perimeter","divide-and-conquer","closest-pair","closest-pair-of-points","nlogn"],"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":75,"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%253ASlavkoPrytula%252FFind-The-Closest-Pair-Of-Points%2B%2Blanguage%253APython","metadata":null,"warn_limited_results":false,"csrf_tokens":{"/SlavkoPrytula/Find-The-Closest-Pair-Of-Points/star":{"post":"Lt8fv3LWtK7sLlDd21yORgnUqdi4ZYTHXyr1vR0gDVSWp23MGhNPV6_V34TLpP3vZRzxGJLokg78AGJIIxY9Cg"},"/SlavkoPrytula/Find-The-Closest-Pair-Of-Points/unstar":{"post":"qFjBuonwj4MfEZRTyQJQLZ1zgeWYmLsQ_WT4WvHQTfKIhXAzknygbOsA9SFEUXlnHwaCWaiXhLHNYWNjGsHOBQ"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"h86A1adw_jgP0GDlZPWMpvHcpaDoOqgNNIF6TGpv1br3D9AZtUTs06KtqxDzPRZgLrF4dxudZfuicvAHXgGXjg"}}},"title":"Repository search results"}