package recursion;

public class Sum {

    public static int iterSum(int n) {
        int sum = 0;

        for (int i = 1; i <= n; ++i) {
            sum += i;
        }

        return sum;
    }

    public static int recSum(int n) {
        if (n == 0) {
            return 0;
        } else {
            return n + recSum(n - 1);
        }
    }

    public static void main(String[] args) {

        System.out.println(iterSum(10));
        System.out.println(recSum(10));
        
        // How deep can this program recurse before it exceeds the limit?
//        int limit = Integer.parseInt(args[0]); 
//        System.out.println(recSum(limit));

    }
}