Array Max, Min, and Count Patterns in AP CSA

Three of the most tested array algorithms on the AP exam. These patterns appear in FRQs almost every year, often combined with other conditions.

Finding the Maximum

int[] scores = {72, 95, 88, 61, 99, 84};

// Initialize max to FIRST element, not 0
int max = scores[0];

for (int i = 1; i < scores.length; i++) {
    if (scores[i] > max) {
        max = scores[i];
    }
}
System.out.println("Max: " + max);  // 99

Finding the Minimum

int min = scores[0];
for (int score : scores) {
    if (score < min) {
        min = score;
    }
}
System.out.println("Min: " + min);  // 61

Counting Elements that Meet a Condition

int count = 0;
for (int score : scores) {
    if (score >= 90) {
        count++;
    }
}
System.out.println("Count of 90+: " + count);  // 2

public static int mystery(int[] arr) {
    int count = 0;
    int max = arr[0];
    for (int v : arr) if (v > max) max = v;
    for (int v : arr) if (v == max) count++;
    return count;
}