Question

Devise an algorithm that finds the first term of a sequence of integers that equals some previous term in the sequence.

Short answer

An algorithm of determining the first term of a sequence of inters that equals some previous term in the sequence.

procedurerepeated ($a_1,a_2,...,a_n:$ list of integers having n > 0 )

$$\begin{gathered} j=2 \\ position:=0 \end{gathered}$$

while$j\le n$ and position = 0

will show the position of the first term of a sequence of integers that equals some previous term in the sequence.

Step-by-step solution

Write the steps required to follow to determine Algorithm.

First set j equals to 2 and position equals to 0 .

Then use while loop to examine given list and condition for while loop is $j\le n$and position = 0 .

In while loop set k equal to 1 and use another while loop with condition k < j and position + 0 . Compare $a_j$and $a_k$ using the if loop with condition$a_j=a_k$ and when if loop becomes true, return then position as and when if loop becomes false then increase k by 1 . After the completion of if loop increase j by 1 .

Here the position is our required answer.

Determine the steps of the algorithm.

By using the above conditions, the algorithm findsthe first term of a sequence of inters that equals some previous term in the sequence can be written as:

procedurerepeated ($a_1,a_2,..,a_n:$ list of integers having n > 0 )

j = 2

position : = 0

while$j\le n$ and position = 0