NICOLAS GUARINI — M. 918670 — [email protected]

Identify the LSCAJs for the following 2 programs:

public boolean palindrome(String str) {
    int len = str.length();
    for (int i = 0; i < Math.floor(len / 2); i++) {
        if (str.charAt(i) != str.charAt(len - 1 - i)) {
            return false;
        }
    }
    return true;
}

public boolean is_prime_decomposition(int number, int i) {
    if (number % i == 0) {
        for (int j = 2; j <= i / 2; j++) {
            if (i % j == 0) {
                return false;
            }
        }
        return true;
    } else {
        return false;
    }
}