{"payload":{"header_redesign_enabled":false,"results":[{"id":"507130725","archived":false,"color":"#f34b7d","followers":0,"has_funding_file":false,"hl_name":"rixsilverith/sorting-search-benchmarks","hl_trunc_description":"Benchmark tool to demonstrate classical sorting and search algorithms computational time complexity empirically.","language":"C++","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":507130725,"name":"sorting-search-benchmarks","owner_id":71402816,"owner_login":"rixsilverith","updated_at":"2022-07-12T10:50:20.234Z","has_issues":true}},"sponsorable":false,"topics":["algorithms","sorting-algorithms","gnuplot","algorithm-analysis","search-algorithms","gnuplot-script"],"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":74,"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%253Arixsilverith%252Fsorting-search-benchmarks%2B%2Blanguage%253AC%252B%252B","metadata":null,"warn_limited_results":false,"csrf_tokens":{"/rixsilverith/sorting-search-benchmarks/star":{"post":"P6RzEDnEIrrj91m_AFm4cQ81oDzFmut8nzOHzR3TFTU4CY5wXJBHmBjQj1ECl8Yl6BNZOdaXPuTZEP8NVtFoZw"},"/rixsilverith/sorting-search-benchmarks/unstar":{"post":"J5trb5zvzUQRUJATlb2lVJ5zFotTxFXjR5Mppw_smPOTcZQ21gGzU9acwGVq2qjNQYKJOpY9G-jgf8U0UsNBlw"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"NSy5R4mMLDXqA-DMyNijojC7JO5Q8C2KXZAe4qeqjBje2E_PuVngBNQz4zTKgoQmFtXD5Zt0mgivC1tWLvEPKg"}}},"title":"Repository search results"}