Question

13) Find the exact complexity, counting each assignment and comparison and also the Big O notation

For (i=0; i<n; i++)

For (j=3; j<n; j++)

a=a+b;

Answer 1

We have for(i=0; i<ngitt) for(j=3; j<ngitt) a=a+bi As we can see that both the for" loop are nested but both are independent to each other ire one is not dependent on the running of other, so we can check each loop individually. for(icogi angitt), exactly execute en times from izo, 1.. M-1) ... and for i=3; j< n itt) enactly execute "migh times from izz .(M-1) = -1)-3+1 in-4t1 = n-3 So overall complexity will be o(n* (n-3)) .. as both are nested. we have olne-zn) we can eliminate the term which is lower or In Bigoh we take the upper bound only, So, we have, o (n) Time complexity,