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: $$\begin{array} { l }
t : = 1 \
\text { for } i = n \text { to } n ^ { 2 } \
t : = t + 2 i t
\end{array}$$

Question

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: $$\begin{array} { l } 
t : = 1 \
\text { for } i = n \text { to } n ^ { 2 } \
t : = t + 2 i t
\end{array}$$

Quizplus · Accepted Answer

The Answer of 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: $$\begin{array} { l } 
t : = 1 \
\text { for } i = n \text { to } n ^ { 2 } \
t : = t + 2 i t
\end{array}$$

Give a Big-O Estimate for the Number of Operations (Where t:=1 for i=n to n2t:=t+2it\begin{array} { l } t : = 1 \\\text { for } i = n \text { to } n ^ { 2 } \\t : = t + 2 i t\end{array}t:=1 for i=n to n2t:=t+2it​

Give a Big-O Estimate for the Number of Operations (Where $\begin{array} { l } t : = 1 \\\text { for } i = n \text { to } n ^ { 2 } \\t : = t + 2 i t\end{array}$