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