✅ 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=n; i > 1; i=i/2)
for(j=0; j < 3*n; j++)
c++
for(i=c; i > 0; i--)
if(odd(i))
for(j=n/2; j < n; j++)
c++
else
for(j=1; j < 900; j=j*3)
c++
return c
Mis on antud algoritmi halvima juhu keerukus O-notatsioonis sõltuvalt sisendparameetrist n: