Katsed.java

import ee.ut.dendroloj.Dendrologist;
import ee.ut.dendroloj.Grow;

import java.awt.*;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;

public class Katsed {
    @Grow
    static int unaarne(int x, String y) {
        if (x == 0) return 1;
        return 1 + unaarne(x - 1, y);
    }

    private static final Set<Integer> seenValues = new HashSet<>();

    @Grow
    static int fib(int n) {
        if (seenValues.contains(n)) {
            Dendrologist.paint(Color.MAGENTA);
        }
        seenValues.add(n);

        if (n < 2) return n;
        return fib(n - 2) + fib(n - 1);
    }

    @Grow
    static int fib3(int n) {
        if (n < 2) return n;
        return fib3(n - 3) + fib3(n - 2) + fib3(n - 1);
    }

    @Grow
    static void tree(int w, int h) {
        if (h <= 1) {
            return;
        }
        for (int i = 0; i < w; i++) {
            tree(w, h - 1);
        }
    }

    @Grow
    static void unbalancedTree(int w, int h) {
        if (h <= 1) {
            return;
        }
        for (int i = 0; i < w; i++) {
            unbalancedTree(i, h - 1);
        }
    }

    @Grow
    static int[] pööraJupid(int[] massiiv) {
        Dendrologist.paint(Color.YELLOW);
        if (Math.random() < 0.2) {
            throw new RuntimeException("Random failure");
        }
        if (massiiv.length < 2) {
            return massiiv;
        } else if (massiiv.length == 2) {
            return new int[]{massiiv[1], massiiv[0]};
        } else {
            int[] väljund = new int[massiiv.length];
            int[] väljundA = pööraJupid(Arrays.copyOfRange(massiiv, 0, massiiv.length / 2));
            System.arraycopy(väljundA, 0, väljund, 0, väljundA.length);
            int[] väljundB = pööraJupid(Arrays.copyOfRange(massiiv, massiiv.length / 2, massiiv.length));
            System.arraycopy(väljundB, 0, väljund, väljundA.length, väljundB.length);
            return väljund;
        }
    }

    @Grow
    public static int abi2(int[] a, int i, int n) {
        //i - nii palju on massiivis elemente olemas
        //keerukus Teeta(3^n)
        if (n == 0)
            return 1;
        // i elementi on paigas
        a[i] = 0;
        int summa = abi2(a, i + 1, n - 1);
        a[i] = 1;
        summa += abi2(a, i + 1, n - 1);
        a[i] = 2;
        summa += abi2(a, i + 1, n - 1);
        return summa;
    }

    public static void main(String[] args) {
        // Dendrologist.setUIScale(2.0);
        // Dendrologist.setShowMethodNames(true);
        // Dendrologist.setArgumentCapture(true, false);
        Dendrologist.wakeUp();

        unbalancedTree(6, 3);
        // tree(5, 3);
        // fib3(6);

        // fib(14);
        fib(8);
        // pööraJupid(new int[]{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11});

        abi2(new int[3], 0, 3);
    }
}