Informal Run-Time Analysis Practice Test

A student counts how many pairs of different values appear in an int[] of size $n$.

public static int countDifferentPairs(int[] data) {

    int count = 0;

    for (int i = 0; i < data.length; i++) {

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

            if (data<u>i</u> != data<u>j</u>) {

                count++;

            }

        }

    }

    return count;

}

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

A recursive method counts how many times a number can be halved before reaching 1, for input size $n$.

public static int halveCount(int n) {

    if (n <= 1) {

        return 0;

    } else {

        return 1 + halveCount(n / 2);

    }

}

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