Question

c++

QUESTION 1 What is the Big-Oh of the following computation? int sum = 0; for (int counter = 1; counter <n; counter++) sum = sum + counter: TTT Arial 3 (12pt) T E E 5.0 25 Path:p QUESTION 2 Click Save and Submit to save and submit. Click Save All Arera to save all answers arch

Answer 1

Here is the step by step time taken by each statement

int sum = 0; This statement takes 1 unit of time
for(int counter = 1; counter < n; counter++) This statement is executed n times
So its time taken is n units
1 is added extra for a loop
because it has to check condition 1 extra time
sum = sum + counter This statement is executed n - 1 times
So its time taken is n - 1 units

Total time = 1 + n + (n - 1)
= 2 * n
= O( n )

Thus time complexity of the above program is O(n)

Hope this helps. Please rate the answer if you like it.