GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — JavaScript/Dynamic-Programming/KadaneAlgo.js at master · Sese-Brazil/JavaScript Expand file tree/ Copy pathKadaneAlgo.jsMore file actions 25 lines (24 loc) · 942 Bytes / Copy pathKadaneAlgo.jsFile metadata and controls25 lines (24 loc) · 942 Bytes 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 /* 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 } |
| You are visitor 01402520 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |