/**
* Linear-time maximum contigous subsequence sum algorithm.
*/
public static int maxSubSum4( int [ ] a )
{
/* 1*/ int maxSum = 0, thisSum = 0;    /* 2*/ for( int j = 0; j < a.length; j   )
{
/* 3*/ thisSum  = a[ j ];    /* 4*/ if( thisSum > maxSum )
/* 5*/ maxSum = thisSum;
/* 6*/ else if( thisSum < 0 )
/* 7*/ thisSum = 0;
}
/* 8*/ return maxSum;
}