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