Returns largest subsequence sum in C#.

LargestSubsequenceSum.cs

public static double LargestSubsequenceSum(IEnumerable<double> list) 
{
    var arr = list.ToArray();
    double currentMax = arr[0];
    double max = currentMax;
    for (int i = 1; i < arr.Length; i++)
    {
        currentMax = Max(currentMax, currentMax+arr[i]);
        max = Max(max, currentMax);
    }
    return max;
}