phillco

/**
 * Uses a smart, O(n) function to find the maximum subarray.
 */
def find_max_subarray_smart( array ) {

    int max, max_start, max_end, start, tentative = 0;
    for ( int i = 0; i < array.size(); i++ ) {
                
        tentative += array[i];