In AP Computer Science A, the maximum value algorithm is a standard iteration pattern (EK 2.9.A.1) that loops through values, compares each one to a stored running maximum, and replaces the maximum whenever a larger value is found.
The maximum value algorithm is one of the standard algorithms named in EK 2.9.A.1 in Topic 2.9. The idea is simple. You keep one variable (usually called max) that holds the largest value seen so far. Inside a loop, you compare each new value to max. If the new value is bigger, you assign it to max. When the loop ends, max holds the largest value of them all.
The whole algorithm hinges on one decision you make before the loop even starts, and that is what you initialize max to. The safe choices are the first value you process or a very small sentinel like Integer.MIN_VALUE. Initializing max to 0 is the classic bug. If every value is negative, 0 "wins" every comparison and your answer is wrong. Think of it like a leaderboard with one slot. Every new score challenges the current champion, and only a strictly larger score takes the slot.
This pattern lives in Topic 2.9 (Implementing Selection and Iteration Algorithms) in Unit 2 and directly supports learning objective AP Comp Sci A 2.9.A, which asks you to develop standard algorithms and determine what they produce. EK 2.9.A.1 explicitly lists determining a minimum or maximum value as one of the standard algorithms you're expected to write from scratch, without arrays or lists. That last part matters. In Unit 2 you find the max of values coming from a loop counter, a formula, or user-style input, using nothing but a variable, an if statement, and a loop. Later in the course the exact same logic gets pointed at arrays and ArrayLists, so nailing it now pays off twice. It's also one of the cleanest places to practice combining selection (the if) with iteration (the loop), which is the entire point of Unit 2.
Keep studying AP® Computer Science A Unit 2
Minimum/maximum determination (Unit 2)
The minimum value algorithm is the same code with the comparison flipped. You update when the new value is smaller, and you initialize with the first value or Integer.MAX_VALUE. If you can write one, you can write the other in ten seconds.
Accumulator pattern (Unit 2)
A running max is really an accumulator with a condition attached. A sum accumulator updates on every pass, while a max accumulator only updates when the new value beats the current one. Recognizing both as 'one variable that collects an answer across a loop' makes Unit 2 code much easier to trace.
Digit extraction (Unit 2)
EK 2.9.A.1 also covers pulling individual digits out of an integer with % 10 and / 10. The AP exam loves stacking patterns, so expect problems like 'find the largest digit of n,' which is digit extraction feeding values into a maximum value algorithm.
Position accumulation (Unit 2)
Sometimes the question isn't 'what is the max?' but 'where did it occur?' Position accumulation tracks the index or iteration count of the current max alongside the value itself. Forgetting to update both variables together is a favorite trap in code-tracing questions.
On the multiple-choice section, the maximum value algorithm usually shows up as a code-tracing question. You'll see a loop with an if (value > max) update and get asked what max holds at the end, often with sneaky inputs like all-negative numbers or a max that appears first or last. Buggy-initialization questions (starting max at 0) are common, so check the data before trusting the code. On the free-response section, Methods and Control Structures questions frequently require a running max or min as part of a larger method, like finding the highest score or the best result of a simulation. No released FRQ uses the phrase 'maximum value algorithm' verbatim, but the pattern itself is one of the most reused building blocks in FRQ solutions. You need to be able to write it cold, choose a correct initial value, and adapt it (largest digit, latest max, max plus its position) without a template.
The two algorithms are mirror images, and mixing up the details costs points. For a maximum, you update when the new value is GREATER than your tracker, and a safe sentinel start is Integer.MIN_VALUE. For a minimum, you update when the new value is LESS, and the sentinel is Integer.MAX_VALUE. The most common error is pairing the wrong sentinel with the wrong comparison, like starting a max search at Integer.MAX_VALUE, which means nothing can ever win the comparison.
The maximum value algorithm keeps one variable for the largest value seen so far and replaces it inside a loop whenever a larger value appears.
It is one of the standard algorithms named in EK 2.9.A.1, so the AP exam expects you to write it from scratch and trace someone else's version of it.
Initialize the max with the first value you process or with Integer.MIN_VALUE, because starting at 0 breaks the algorithm when every value is negative.
Flipping the comparison from greater-than to less-than turns the maximum algorithm into the minimum algorithm.
Using strictly greater-than keeps the first occurrence of a tied max, while greater-than-or-equal keeps the last occurrence, and MCQs do test that difference.
The same pattern returns later in the course with arrays and ArrayLists, so mastering it in Unit 2 is an investment, not a one-off.
It's a standard Unit 2 pattern (EK 2.9.A.1) where you store a running maximum in a variable, compare each new value to it inside a loop, and update the variable when a larger value shows up. After the loop, the variable holds the overall maximum.
No, not safely. If all the values are negative, 0 beats every one of them and your code returns the wrong answer. Initialize with the first value in the data or with Integer.MIN_VALUE instead.
An accumulator like a sum updates on every single loop iteration, while a running max only updates when the new value passes a comparison test. Both use one variable to build an answer across a loop, which is why they feel similar.
With strictly greater-than (>), the first occurrence of a tied maximum is kept. With greater-than-or-equal (>=), the last occurrence wins. The final max value is the same either way, but if the question also tracks position or index, the choice changes your answer.
No. In Topic 2.9 you apply it without any data structures, finding the max of values produced by a loop, a calculation, or method calls. Arrays come later in the course, and the algorithm transfers directly when they do.
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.