Algorithm for Maximun Sum of a SubArray in Swift

kadaneSumMaxSubArray.swift

import Cocoa

func kadaneSumMaxSubArray(_ values: [Int]) -> Int {
    guard let firstValue = values.first else { return 0}
    var current = firstValue
    var global = firstValue
    for value in values[1 ..< values.count] {
        current = (current + value) < current ? 0 : current
        current = max(current, (current + value))
        global = max(global, current)
    }
    return global
}

kadaneSumMaxSubArray([1,2,-1,0]) //3
kadaneSumMaxSubArray([1,0,-1,0]) // 1
kadaneSumMaxSubArray([1,1,-1,2,5,16,-10]) // 23
kadaneSumMaxSubArray([1,2,-1,15]) // 15