Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Max Subarray using divide and conquer #2919

Closed
subhroacharjee opened this issue Jan 28, 2022 · 3 comments
Closed

Max Subarray using divide and conquer #2919

subhroacharjee opened this issue Jan 28, 2022 · 3 comments
Assignees
@gabcoroba

Comments

@subhroacharjee
Copy link
Contributor

Is your feature request related to a problem? Please describe.
Maximum subarray problem.

Describe the solution you'd like
using divide and conquer.

Describe alternatives you've considered

Additional context
@gabcoroba
Copy link

I will take this issue.

@rameez471
Copy link
Contributor

If nobody is currently working can I take this up ?

@siriak
Copy link
Member

siriak commented Mar 8, 2022

I think it's already implemented here https://github.com/TheAlgorithms/Java/blob/0a062d4616565845784b344dc4aab4769e5ec6af/src/main/java/com/thealgorithms/dynamicprogramming/KadaneAlgorithm.java

@siriak siriak closed this as completed Mar 8, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@gabcoroba gabcoroba

Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
4 participants
@siriak @rameez471 @gabcoroba @subhroacharjee