{"id":26222781,"url":"https://github.com/mmushfiq/maximumsubarray","last_synced_at":"2026-04-19T20:38:02.864Z","repository":{"id":83787304,"uuid":"133361319","full_name":"mmushfiq/MaximumSubarray","owner":"mmushfiq","description":"Maximum subarray problem. Brute Force, Divide and Conquer, Kadane's Algorithm","archived":false,"fork":false,"pushed_at":"2018-05-15T19:05:30.000Z","size":20,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-12T17:19:51.617Z","etag":null,"topics":["brute-force","divide-and-conquer","kadanes-algorithm","largest-sum-contiguous-subarray","maximum-subarray","time-complexity"],"latest_commit_sha":null,"homepage":"https://www.mycertnotes.com/az/maximum-subarray-problemi-kadane-alqoritmi/","language":"Java","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/mmushfiq.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":"2018-05-14T13:01:26.000Z","updated_at":"2022-09-01T09:15:05.000Z","dependencies_parsed_at":null,"dependency_job_id":"0de224be-ce2a-49ad-8a62-62d5fac030bd","html_url":"https://github.com/mmushfiq/MaximumSubarray","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/mmushfiq/MaximumSubarray","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mmushfiq%2FMaximumSubarray","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mmushfiq%2FMaximumSubarray/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mmushfiq%2FMaximumSubarray/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mmushfiq%2FMaximumSubarray/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/mmushfiq","download_url":"https://codeload.github.com/mmushfiq/MaximumSubarray/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mmushfiq%2FMaximumSubarray/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28007817,"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","status":"online","status_checked_at":"2025-12-24T02:00:07.193Z","response_time":83,"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":["brute-force","divide-and-conquer","kadanes-algorithm","largest-sum-contiguous-subarray","maximum-subarray","time-complexity"],"created_at":"2025-03-12T17:19:43.937Z","updated_at":"2025-12-24T20:17:38.116Z","avatar_url":"https://github.com/mmushfiq.png","language":"Java","readme":"# MaximumSubarray\nMaximum subarray problem. Brute Force, Divide and Conquer, Kadane's Algorithm\n\nMore info: [https://www.mycertnotes.com/az/maximum-subarray-problemi-kadane-alqoritmi/](https://www.mycertnotes.com/az/maximum-subarray-problemi-kadane-alqoritmi/)\n\n***\nThe following stock problem is given in [Introduction to Algorithms](https://www.amazon.com/Introduction-Algorithms-3rd-MIT-Press/dp/0262033844) book (on page 68), you can solve it using \"Maximum-subarray\":\n\n![maximum-subarray-practical-example](http://www.mycertnotes.com/wp-content/uploads/2017/07/maximum-subarray-practical-example.jpg)\n\n***\n\n\nIt is shown three solution for maximum-subarray problem in this project:\n\nN | Algorithm | Time complexity\n----|----|----\n1 | Brute-force | O(n^2)\n2 | Divide and Conquer | O(nlogn)\n3 | Kadane's Algorithm | O(n)\n\n\u003cbr\u003e\nI compared these three solutions in my local machine and result was (duration is given with milliseconds):\n\u003cbr\u003e\u003cbr\u003e\n\nArray length | Brute-force| Divide and Conquer | Kadane's Algorithm\n----|----|----|----\n1000 | 13 ms | 2 ms | 1 ms\n1_000_000 | 646535 ms | 115 ms | 9 ms\n\n***\n\n### Time complexity:\n![time-complexity](http://www.mycertnotes.com/wp-content/uploads/2017/07/rate-of-growth.jpg)\n\n\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmmushfiq%2Fmaximumsubarray","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmmushfiq%2Fmaximumsubarray","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmmushfiq%2Fmaximumsubarray/lists"}