Question

all terms of a finite sequence of integers that are greater than the sum of all previous terms of the sequence.

Short answer

An algorithm for determining all terms of a finite sequence of integers that are greater than the sum of all previous terms of the sequence

procedurelist ($a_1,a_2,...,a_n:$ list of integers)

j = 1

sum := 0

fork = 1 to n

The outcomes list is$\left\{resul{t}_1,resul{t}_2,......\right\}$ with all terms of a finite sequence of integers that are greater than the sum of all previous terms of the sequence

Step-by-step solution

Write the steps required to follow to determine Algorithm.

First set j equals to 1 and sum equals to 0 .

Then use for loop to examine given list and condition for while loop is k =1 to n .

In for loop compare element $a_k$and sum by using the if loop with condition$a_k>sum$ . When if loop becomes true add$a_k$ to the list resulr at position j and that will increase j by 1 .

The sum will be determined accordingly and the list of result will be our answer.

Determine the steps of the algorithm.

By using the above conditions, the algorithm findsall terms of a finite sequence of integers that are greater than the sum of all previous terms of the sequence

procedurelist ($a_1,a_2,..,a_n$ list of integers)

$$\begin{gathered} j=1 \\ sum:=0 \end{gathered}$$

fork = 1 to n