{"id":22612252,"url":"https://github.com/ivanbgd/branch_prediction","last_synced_at":"2025-07-06T02:38:50.132Z","repository":{"id":139676928,"uuid":"76410559","full_name":"ivanbgd/Branch_Prediction","owner":"ivanbgd","description":"Compares execution speed of processing sorted and unsorted arrays, with and without branching. Disassembly and results included.","archived":false,"fork":false,"pushed_at":"2016-12-14T01:09:51.000Z","size":45,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-02-03T10:11:58.602Z","etag":null,"topics":["branch-prediction","c-plus-plus","cplusplus","cpp"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/ivanbgd.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2016-12-14T00:40:07.000Z","updated_at":"2023-08-01T20:52:16.000Z","dependencies_parsed_at":null,"dependency_job_id":"9b650deb-b71c-4c91-bcb0-0ff3116eb115","html_url":"https://github.com/ivanbgd/Branch_Prediction","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ivanbgd%2FBranch_Prediction","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ivanbgd%2FBranch_Prediction/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ivanbgd%2FBranch_Prediction/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ivanbgd%2FBranch_Prediction/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ivanbgd","download_url":"https://codeload.github.com/ivanbgd/Branch_Prediction/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246117690,"owners_count":20726068,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["branch-prediction","c-plus-plus","cplusplus","cpp"],"created_at":"2024-12-08T17:11:37.134Z","updated_at":"2025-03-28T23:44:39.680Z","avatar_url":"https://github.com/ivanbgd.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Branch_Prediction\nCompares execution speed of processing sorted and unsorted arrays, with and without branching. Loop interchange has also been tested.\n\nDisassembly from MSVS 2015 is included in the source file, and results are in screenshots.\n\nMotivation:\n\nWhy is it faster to process a sorted array than an unsorted array?\nhttp://stackoverflow.com/questions/11227809/why-is-it-faster-to-process-a-sorted-array-than-an-unsorted-array\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fivanbgd%2Fbranch_prediction","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fivanbgd%2Fbranch_prediction","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fivanbgd%2Fbranch_prediction/lists"}