Question: Given the following algorithm: ALGORITHM Mystery(n) //Input: A nonnegative integer n SO for i=1 to n do SES +i*i return S Pick the summation formula
Given the following algorithm: ALGORITHM Mystery(n) //Input: A nonnegative integer n SO for i=1 to n do SES +i*i return S Pick the summation formula that represents the running time n T(n) = O = 1 in T(n)= an? 1 = 1 n T(n) = 1 = 1 T(n) = Iogn = 1
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
