Practice Test 2

A method finds the smallest value in an int[] of size $n$.

public static int minValue(int[] nums) {

    int min = nums<u>0</u>;

    for (int i = 1; i < nums.length; i++) {

        if (nums<u>i</u> < min) {

            min = nums<u>i</u>;

        }

    }

    return min;

}

What is the run-time complexity of the algorithm in the code snippet?

A recursive method prints a pattern by calling itself twice on $n-1$ until $n==0$.

public static void doublePrint(int n) {

    if (n == 0) {

        return;

    }

    System.out.println(n);

    doublePrint(n - 1);

    doublePrint(n - 1);

}

What is the run-time complexity of the algorithm in the code snippet?