public static int kadanesAlgorithm(int[] array) { int maxEndingHere = array[0]; int maxSoFar = array[0]; for(int i=1; i<array.length; i++){ maxEndingHere = Math.max(maxEndingHere+ array[i], array[i]); maxSoFar = Math.max(maxSoFar, maxEndingHere); } return maxSoFar; }
Preview:
downloadDownload PNG
downloadDownload JPEG
downloadDownload SVG
Tip: You can change the style, width & colours of the snippet with the inspect tool before clicking Download!
Click to optimize width for Twitter