Answers for "kadane's algorithm geeks for geeks"

kadane algorithm

public int kadane(int[] arr){
	int max_so_far = 0, curr_max = Integer.MIN_VALUE;
    for(int i: arr){
    	max_so_far += i;
        if(max_so_far<0) max_so_far = 0;
        if(max_so_far>curr_max) curr_max = max_so_far;
    }
    return curr_max;
}

Posted by: Guest on June-20-2020

Code answers related to "kadane's algorithm geeks for geeks"

Code answers related to "C#"

C# Answers by Framework

Browse Popular Code Answers by Language

Answers for "kadane's algorithm geeks for geeks"

Code answers related to "kadane's algorithm geeks for geeks"

Code answers related to "C#"

C# Answers by Framework

Browse Popular Code Answers by Language

Answers for "kadane's algorithm geeks for geeks"

Code answers related to "kadane's algorithm geeks for geeks"

Code answers related to "C#"

C# Answers by Framework

Browse Popular Code Answers by Language

Popular Programming Languages

Advertisements

Company

Compilers

Help

Connect with us