If the numbers in our list were not unique and therefore the largest number could occur more than once, would the algorithm find the first occurrence?

Get a value for n, the size of the list Get values for A1, A2, . . . , An, the list to be searched Set the value of largest so far to A1 Set the value of location to 1 Set the value of i to 2 While (i less than or equal to n) do If Ai > largest so far then Set largest so far to Ai Set location to i Add 1 to the value of i End of the loop Print out the values of largest so far and location

is the idea that any random set of numbers can be plugged into this algorithm and worked??