package ru.mirea.nikita0719;

public class Main {

     //задача 1
    static String recursion1(int n) {
        int sum = 0;
        int j = 0;
        if (n == 1) {
            System.out.print("1");
        } else {
            for (int i = 1; sum < n; i++) {
                sum += i;
                j = i;
            }
            System.out.print(recursion1(--n) + " " + j);
        }
        return "";
    }

    //задача 2
     static String recursion2(int n) {
        if (n == 1) {
            return "1";
        }
        return recursion2(n - 1) + " " + n;
    }

    //задача 3
    static String recursion3(int a, int b) {
        if (a > b) {
            if (a == b) {
                return Integer.toString(a);
            }
            return a + " " + recursion3(a - 1, b);
        } else {
            if (a == b) {
                return Integer.toString(a);
            }
            return a + " " + recursion3(a + 1, b);
        }
    }
    public static void main(String[] args) {
        recursion1(5);
        System.out.println();
        System.out.println();
        System.out.println(recursion2(10));
        System.out.println();
        System.out.println(recursion3(20,15));
        System.out.println(recursion3(10, 15));
    }
}