Question

Write an algorithm that finds the largest number in a list (an array) of $n$ numbers.

Short answer

The largest number in the list can be found by initializing a 'maxNumber' variable with the first element of the list. Then, using a loop to iterate through the list, each element is compared with 'maxNumber'. If an element is greater than 'maxNumber', 'maxNumber' is updated with this element. This process continues until all elements in the list have been examined, and 'maxNumber' is then the largest number in the list.

Step-by-step solution

Initialize Maximum Variable

Create a variable, for example named 'maxNumber', with an initial value as the first element of the list. This number is the maximum (or the largest) number found so far.

Iterate Through the List

Using a loop, iterate through each element in the list starting from the second number (since we have already used the first element to initialize the 'maxNumber').

Compare and Update

In this step, while iterating through the list, compare each element with 'maxNumber'. If the current element is greater than 'maxNumber', update 'maxNumber' to the current element.

Continue Until End of List

Continue the iteration until the entire list has been traversed. All elements have been compared with 'maxNumber'.

Return Result

After completing the iteration, 'maxNumber' will hold the largest number in the list. Return 'maxNumber' as the final result of the algorithm.