Crowdly
Add to Chrome
int find_c(int n) int i,j,c for(i=2*n; i > 0; i--) for(j=0; 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=2*n; i > 0; i--)
for(j=0; j < 3*n; j++)
c++
for(i=c; i > 0; i--)
if(odd(i))
for(j=4*n; j > n; j--)
c++
else
for(j=2*n*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%