Write and algorithm that finds the smallest element in the sequence s1, s2,.,sn of n distinct numbers. The input is the sequence, s, and the index, n, of the last term of the sequence. The output is the index of the smallest element in the sequence. This is what I have. I know its wrong but I am just trying to understand it. Input: s1,s2, s3,..,sn

Output: ?

Algorithm:

1. i=0

2. Out=0

3. i = i +1

4. if Out > i, Out=i

5. Repeat 3 and 4 until i==n

6. Display the smallest number