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.

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

Kadane's Algorithm #305

Open
manan2110 opened this issue Oct 14, 2020 · 0 comments
Open

Kadane's Algorithm #305

manan2110 opened this issue Oct 14, 2020 · 0 comments

Comments

@manan2110
Copy link

manan2110 commented Oct 14, 2020

Title or Name of the Algorithm :-
Kadane’s Algorithm

Describe the algorithm
It is an algorith used to calculate Largest Sum in Contiguous Subarray.
Simple idea of the Kadane’s algorithm is to look for all positive contiguous segments of the array , And keep track of maximum sum contiguous segment among all positive segments.
Algorithmic Paradigm: Dynamic Programming

@manan2110 manan2110 changed the title Kadanes Kadane's Algorithm Oct 14, 2020
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging a pull request may close this issue.

1 participant