com.alexprut.algo.algorithms

Class MaximumSubarray

java.lang.Object

com.alexprut.algo.algorithms.MaximumSubarray

public class MaximumSubarray
extends java.lang.Object

J.Kadane algorithm (i.e. https://en.wikipedia.org/wiki/Maximum_subarray_problem)

Constructor Summary

Constructors

Constructor and Description
MaximumSubarray()

Method Summary

Modifier and Type	Method and Description
static int	maximumSubarray(int[] elements) Finds the contiguous sub-array within a one-dimensional array, a[1...n], of numbers which has the largest sum Time complexity: Θ(n) Space complexity: Θ(n) total with Θ(1) auxiliary

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

MaximumSubarray

public MaximumSubarray()

Method Detail

maximumSubarray

public static int maximumSubarray(int[] elements)

Finds the contiguous sub-array within a one-dimensional array, a[1...n], of numbers which has the largest sum Time complexity: Θ(n) Space complexity: Θ(n) total with Θ(1) auxiliary