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