Finding a Maximum or Minimum in a Loop

A computer never sees the whole array at once. It sees one element at a time and remembers one thing: the best value found so far. Set max equal to the first element, then walk through the rest of the array one by one. At each stop, compare the current element to max. If the current element is bigger, it becomes the new max. If not, max stays exactly as it is and the loop moves on. By the time the loop ends, max has silently been compared against every element and survived every challenge, so it must be the largest value in the whole array.

Think of it like a running champion in a tournament. The first contestant to step up is champion by default. Every new contestant only takes the title if they actually beat the current champion — ties and losses change nothing. This is why initialization matters so much: start max at the array's own first element, not at some arbitrary number like 0. If the array is full of negative numbers, nothing will ever exceed 0, and the loop will report a maximum that was never actually in the data. Minimum works the same way in reverse: start min at the first element and replace it only when something smaller appears.

This idea sits right next to other loop patterns like running totals and counting matches — all three share the same shape of initialize, then update once per pass. The variation worth noticing is tracking position instead of value: keep an index variable, update it alongside max whenever a new champion is found, so after the loop you know not just how large the maximum is but exactly where it lives in the array.