recursive SumAndCount

import java.util.ArrayList;
import java.util.List;

public class SumAndCount {

    public static void main(String[] args) {
        ArrayList<Integer> list = new ArrayList<>();
        list.add(1);
        list.add(2);
        list.add(3);
        list.add(1);
        list.add(1);
        System.out.println(sum(list));
        System.out.println(sum(list));
    }

    static int sum(List<Integer> integers) { // dima
        if (integers.isEmpty()) return 0;
        else {
            int lastIndex = integers.size() - 1;
            return integers.get(lastIndex) + sum(integers.subList(0, lastIndex));
        }
    }

    static int sum(ArrayList<Integer> list) { // recursion
        int sum;
        ArrayList<Integer> tempList = new ArrayList<>(list);
        if (tempList.isEmpty()) {
            return 0;
        } else {
            sum = tempList.get(0);
            tempList.remove(0);
            sum += sum(tempList);
        }
        return sum;
    }

    public static int sum1(ArrayList<Integer> list) { // loop
        int sum = 0;
        for (int i : list) {
            sum += i;
        }
        return sum;
    }

    static int countNumberOfItems(ArrayList<Integer> list) {
        int count = 0;
        if (list.isEmpty()) {
            return 0;
        } else {
            for (Integer items : list) {
                count++;
                System.out.println("derp");
            }
        }
        return count;
    }
}