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