best practice for the kadane's algorithm

kadane

public static (int, int) Calculate(int[] array) {
            if (array.Length == 0)
                return (0, 0);

            int firstIndex = 0, lastIndex = 0, candidateFirstIndex = 0;
            int currectSum = 0;
            int globalSum = array[0];
            for (int i = 0; i < array.Length; i++) {
                currectSum += array[i];
                if (array[i] >= currectSum) {
                    candidateFirstIndex = i;
                    currectSum = array[i];
                }

                if (currectSum > globalSum) {
                    lastIndex = i;
                    firstIndex = candidateFirstIndex;
                    globalSum = currectSum;
                }
            }
            return (firstIndex, lastIndex);
        }