-
Notifications
You must be signed in to change notification settings - Fork 61
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #31 from uzairshaikh908/master
i want to add kadane algorithm
- Loading branch information
Showing
1 changed file
with
29 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,29 @@ | ||
import java.io.*; | ||
// Java program to print largest contiguous array sum | ||
import java.util.*; | ||
|
||
class Kadane | ||
{ | ||
public static void main (String[] args) | ||
{ | ||
int [] a = {-2, -3, 4, -1, -2, 1, 5, -3}; | ||
System.out.println("Maximum contiguous sum is " + | ||
maxSubArraySum(a)); | ||
} | ||
|
||
static int maxSubArraySum(int a[]) | ||
{ | ||
int size = a.length; | ||
int max_so_far = Integer.MIN_VALUE, max_ending_here = 0; | ||
|
||
for (int i = 0; i < size; i++) | ||
{ | ||
max_ending_here = max_ending_here + a[i]; | ||
if (max_so_far < max_ending_here) | ||
max_so_far = max_ending_here; | ||
if (max_ending_here < 0) | ||
max_ending_here = 0; | ||
} | ||
return max_so_far; | ||
} | ||
} |