- #1

- 2

- 0

## Homework Statement

Write an algorithm that returns the index of the first occurence of the largest element in the sequence

*s*1,...,

*s*n.

*Example:*If the sequence is 6.2 7.9 4.2 8.9

the algorithm returns the value 4.

I am new here...I read the rules. I am NOT looking for the answer, just some explanations...pointers, so I may be able to understand it and figure it out. I have read the chapter in my book over and over and I just feel like I am reading a different languauge...which I guess I am. I am so very lost.

If anyone would be so kind as to help me out, that would be greatly appreciated.

Bretta

Last edited: