Minimum/maximum determination is a standard AP Computer Science A algorithm (EK 2.9.A.1) that finds the smallest or largest value in a group of numbers by storing a 'best so far' value in a variable and updating it inside a loop whenever a new value beats it.
Minimum/maximum determination is one of the named standard algorithms in EK 2.9.A.1, alongside divisibility checks, digit extraction, frequency counting, and sum/average. The idea is simple. You keep one tracker variable that holds the best value you've seen so far. As a loop processes each new value, an if statement compares the new value to the tracker. If the new value is smaller (for a minimum) or larger (for a maximum), the tracker gets updated. When the loop ends, the tracker holds your answer.
The trickiest part is initialization. You can start the tracker at the first value in the group, or at a sentinel like Integer.MAX_VALUE for a minimum search (so anything you see will be smaller). What you can't safely do is start at 0, because if every value is negative, a max tracker initialized to 0 never updates and you report a maximum that isn't even in the data. That bug is exactly the kind of thing multiple-choice questions are built around.
This lives in Topic 2.9 (Implementing Selection and Iteration Algorithms) in Unit 2, under learning objective 2.9.A, which asks you to develop code for standard algorithms and determine what they produce. Min/max is the algorithm where selection and iteration finally work together. The loop does the visiting, the if statement does the deciding, and a variable carries state between iterations. That 'tracker variable across loop iterations' pattern is the mental model you'll reuse constantly, from array and ArrayList traversals later in the course to almost every Methods and Control Structures FRQ. If you can write a clean max-finder from scratch, you've proven you understand how loops, conditionals, and variables cooperate, which is the whole point of Unit 2.
Keep studying AP® Computer Science A Unit 2
Maximum value algorithm (Unit 2)
This is the max half of min/max determination. Same skeleton, same tracker variable, just a greater-than comparison instead of less-than. Flipping one comparison operator converts a max-finder into a min-finder, which is why the CED treats them as one algorithm.
Accumulator pattern (Unit 2)
Min/max is the accumulator pattern's sibling. Both keep a running variable updated inside a loop, but an accumulator always updates (add every value to a sum) while a min/max tracker updates conditionally (only when the new value wins the comparison).
Position accumulation (Unit 2)
Often you don't just want the largest value, you want where it is. Position accumulation upgrades min/max by tracking the index of the best value instead of (or along with) the value itself, a twist that shows up constantly once arrays arrive.
Digit extraction (Unit 2)
Another EK 2.9.A.1 standard algorithm, and the two combine nicely. Use digit extraction to peel digits off an integer one at a time, then run min/max tracking on those digits to find a number's largest digit. Exam questions love stacking standard algorithms like this.
No released FRQ uses the phrase 'minimum/maximum determination,' but the pattern itself is everywhere. Multiple-choice questions typically hand you a loop with a tracker variable and ask what it outputs, or swap in a buggy version (wrong initialization, > instead of >=, update outside the if) and ask what goes wrong or which input exposes the bug. On the FRQ side, finding a max or min inside a method you write is one of the most common building blocks in Methods and Control Structures and array-based questions. You're expected to do three things: write the algorithm from scratch, trace someone else's version by hand, and spot the classic initialization bug when all values are negative.
Both use a variable that survives across loop iterations, so they look similar at a glance. The difference is the update rule. A sum accumulator updates unconditionally on every pass (total += value), while a min/max tracker only updates when an if statement says the new value beats the current best. If you see a conditional update, you're looking at min/max; if every iteration changes the variable, it's accumulation.
Minimum/maximum determination is a standard algorithm named in EK 2.9.A.1 that finds the smallest or largest value by comparing each value against a tracker variable inside a loop.
The three ingredients are a loop to visit values, an if statement to compare, and a tracker variable that holds the best value seen so far.
Initialize the tracker to the first value or to a sentinel like Integer.MIN_VALUE for a max search; initializing to 0 fails when all the values are negative.
Converting a max-finder into a min-finder only requires flipping the comparison operator, so learn one and you know both.
Unlike a sum accumulator, the min/max tracker updates conditionally, only when a new value wins the comparison.
This pattern reappears all over the exam, especially once arrays and ArrayLists show up and FRQs ask you to find the largest or smallest element.
It's the standard algorithm from EK 2.9.A.1 (Topic 2.9) that finds the smallest or largest value in a set of numbers. You loop through the values, compare each one to a tracker variable, and update the tracker whenever a value beats the current best.
No, not safely. If every value in the data is negative, a max tracker starting at 0 never updates and you report 0, a value that isn't even in the set. Initialize to the first value or to Integer.MIN_VALUE instead.
An accumulator (like a running sum) updates on every loop iteration, no conditions attached. A min/max tracker only updates when an if statement confirms the new value is smaller or larger than the current best. Conditional update means min/max; unconditional means accumulation.
Yes. It's explicitly listed in EK 2.9.A.1 under learning objective 2.9.A, so it's fair game for multiple choice (often as code tracing or bug spotting) and it's a frequent building block inside FRQ methods, especially once arrays appear.
Both find the correct maximum value, but they behave differently with ties. Using > keeps the first occurrence of the max, while >= keeps the last. If a question asks for the position of the maximum, that distinction can change your answer, so read the prompt carefully.
Connect this key term to the AP exam workflow: review the course, practice questions, and check related study tools.
Review units, study guides, and course resources.
Check this vocabulary in multiple-choice context.
Apply key concepts in written AP responses.
Estimate the exam score you are working toward.
Review the highest-yield facts before practice.
Put the full course together before test day.