Crowdly
Add to Chrome
int find_c(int n) int i,j,c for(i=500; i > 1; i=i/2) for(j=1; j...
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
int find_c(int n) int i,j,c
for(i=500; i > 1; i=i/2)
for(j=1; j < 900; j=j*3)
c++
for(i=2*n; i > 0; i--)
if(odd(i/2))
for(j=1; j < 900; j=j*3)
c++
else
for(j=n; j > 0; j--)
c++
return c
Mis on antud algoritmi halvima juhu keerukus O-notatsioonis sõltuvalt sisendparameetrist n:0%
0%
0%
0%
0%
0%
0%
0%
0%
0%
0%