{"payload":{"header_redesign_enabled":false,"results":[{"id":"87716764","archived":false,"color":"#f34b7d","followers":6,"has_funding_file":false,"hl_name":"karakanb/sorting-benchmark","hl_trunc_description":"A basic benchmarking for insertion sort, merge sort and quicksort in C++.","language":"C++","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":87716764,"name":"sorting-benchmark","owner_id":16530606,"owner_login":"karakanb","updated_at":"2017-05-21T11:22:38.888Z","has_issues":true}},"sponsorable":false,"topics":["benchmarking","benchmark","quicksort","mergesort","insertion-sort","sorting-algorithms","performance-analysis","benchmarking-suite","quicksort-algorithm","complexity-analysis"],"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":152,"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%253Akarakanb%252Fsorting-benchmark%2B%2Blanguage%253AC%252B%252B","metadata":null,"csrf_tokens":{"/karakanb/sorting-benchmark/star":{"post":"MDexseK85FQRjiZrMxJH1gTeCWQI_ktaUl0CXCppKBUSIItkX1jGvTMGaKZVO1MTabtS2QUptJtaCBeg6i1baQ"},"/karakanb/sorting-benchmark/unstar":{"post":"mVbbqMjqZYdRs29DKH2a7plN0nx_KOT1qzLl4cUz3uwods3w9Fs37F9QOKLfke-G6NfGtttSk9TBu_vP-CRDXA"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"CqRDkN_mFrdyDoFdGK4ahvXVGzvDudclzkfZyvM4z3pzwlbJ45RgqFwb77d36K1b0RJp5AeI6neYJgZJWOCb8w"}}},"title":"Repository search results"}