Question

Problem 7. Give a big-O estimate for the number of operations where an operation is an addition or a multiplication, used in this segment of an algorithm (ignoring comparisons used to test the conditions in the vhile loop. while i Sn do end while

Answer 1

The loop is running for i values from 1 to n.
Number of operation with in the loop = 2
Summation = 2(1+1+1+...+1)
          = 2n
          = O(n)

$\color{red}Note: \;Please \;comment \;below \;if \;you \;have \;any \;doubts$

$\color{blue}Please\; up\;vote\;the \;solution \;if \;it \;helped.\;Thanks!$