{"id":19619266,"url":"https://github.com/justehmadsaeed/bruteforcevrecursive-algorithms","last_synced_at":"2026-06-12T12:31:29.706Z","repository":{"id":124211300,"uuid":"241612510","full_name":"justEhmadSaeed/BruteForceVRecursive-Algorithms","owner":"justEhmadSaeed","description":"Applied three different techniques⚡ to tackle the most efficient solution of finding the Subarray of an array, which holds the maximum sum of the whole array.","archived":false,"fork":false,"pushed_at":"2020-02-22T19:14:49.000Z","size":356,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-11-21T12:04:14.371Z","etag":null,"topics":["algorithm-challenges","algorithms","algorithms-implemented","brute-force-algorithm","cpp","hybrid-algorithms","recursive-algorithm"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/justEhmadSaeed.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"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":"2020-02-19T12:09:38.000Z","updated_at":"2022-09-22T15:54:10.000Z","dependencies_parsed_at":null,"dependency_job_id":"5735c863-d907-499a-8805-6c06476ca15e","html_url":"https://github.com/justEhmadSaeed/BruteForceVRecursive-Algorithms","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/justEhmadSaeed/BruteForceVRecursive-Algorithms","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/justEhmadSaeed%2FBruteForceVRecursive-Algorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/justEhmadSaeed%2FBruteForceVRecursive-Algorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/justEhmadSaeed%2FBruteForceVRecursive-Algorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/justEhmadSaeed%2FBruteForceVRecursive-Algorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/justEhmadSaeed","download_url":"https://codeload.github.com/justEhmadSaeed/BruteForceVRecursive-Algorithms/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/justEhmadSaeed%2FBruteForceVRecursive-Algorithms/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34245217,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-12T02:00:06.859Z","response_time":109,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["algorithm-challenges","algorithms","algorithms-implemented","brute-force-algorithm","cpp","hybrid-algorithms","recursive-algorithm"],"created_at":"2024-11-11T11:12:59.307Z","updated_at":"2026-06-12T12:31:29.688Z","avatar_url":"https://github.com/justEhmadSaeed.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# BruteForce VS Recursive Algorithms\n\n### We applied three techniques⚡ to tackle the problem of finding the Subarray of an array, which holds the maximum sum of the whole array.\n\n- ## Brute Force Algorithm\n        subArray FIND_MAX_SUBARRAY_BRUTE_FORCE(int *A, int low, int high);\n- ## Recursive Algorithm\n        subArray FIND_MAX_SUBARRAY(int *A, int low, int high);\n        subArray FIND_MAX_CROSSING_SUBARRAY(int *A, int low, int mid, int high);\n\n- ## Hybrid Recursive-BruteForce Algorithm\n        subArray HYBRID_FIND_MAX_SUBARRAY(int *A, int low, int high);\n        subArray FIND_MAX_CROSSING_SUBARRAY(int *A, int low, int mid, int high);\n        subArray FIND_MAX_SUBARRAY_BRUTE_FORCE(int *A, int low, int high);\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjustehmadsaeed%2Fbruteforcevrecursive-algorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjustehmadsaeed%2Fbruteforcevrecursive-algorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjustehmadsaeed%2Fbruteforcevrecursive-algorithms/lists"}