Write Algorithm to Find the Index of Largest Element in Sequence

[Bucs44]

I am having the hardest time getting this algorithm written:

Write an algorithm that returns the index of the first occurrence of the largest element in the sequence s1,..., sn. If the sequence is 6.2, 8.9, 4.2, 8.9, the algorithm returns the value 2.

Input: s, n

Output: ??

I'm stumped on this at the moment - Any help would be greatly appreciated.

 

[matt grime]

The output is m, where m is the index of the first occurence of the largest element.

But that isn't your problem, really, is it? Surely it is writing the algorithm (which is quite easy: how do you find the largest element in a list in a really naive way?) that is the issue, right?