mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-04 07:29:47 +08:00
86d333ee94
* chore: Switch to Node 20 + Vitest * chore: migrate to vitest mock functions * chore: code style (switch to prettier) * test: re-enable long-running test Seems the switch to Node 20 and Vitest has vastly improved the code's and / or the test's runtime! see #1193 * chore: code style * chore: fix failing tests * Updated Documentation in README.md * Update contribution guidelines to state usage of Prettier * fix: set prettier printWidth back to 80 * chore: apply updated code style automatically * fix: set prettier line endings to lf again * chore: apply updated code style automatically --------- Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Co-authored-by: Lars Müller <34514239+appgurueu@users.noreply.github.com>
26 lines
942 B
JavaScript
26 lines
942 B
JavaScript
/* Kadane's algorithm is one of the most efficient ways to
|
|
* calculate the maximum contiguous subarray sum for a given array.
|
|
* Below is the implementation of Kadane's algorithm along with
|
|
* some sample test cases.
|
|
* There might be a special case in this problem if al the elements
|
|
* of the given array are negative. In such a case, the maximum negative
|
|
* value present in the array is the answer.
|
|
*
|
|
* Reference article :- https://www.geeksforgeeks.org/largest-sum-contiguous-subarray/
|
|
*/
|
|
|
|
export function kadaneAlgo(array) {
|
|
let cumulativeSum = 0
|
|
let maxSum = Number.NEGATIVE_INFINITY // maxSum has the least possible value
|
|
for (let i = 0; i < array.length; i++) {
|
|
cumulativeSum = cumulativeSum + array[i]
|
|
if (maxSum < cumulativeSum) {
|
|
maxSum = cumulativeSum
|
|
} else if (cumulativeSum < 0) {
|
|
cumulativeSum = 0
|
|
}
|
|
}
|
|
return maxSum
|
|
// This function returns largest sum contiguous sum in a array
|
|
}
|