✅ 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=0; i < 3*n; i++)
for(j=400; j > 1; j--)
c++
for(i=n; i > 1; i=i/2)
if(even(i/3))
for(j=400; j > 1; 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: