logo

Crowdly

Browser

Add to Chrome

Алгоритм якого методу наведений нижче? left=0; right=N-1; found=false; while (...

✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.

Алгоритм якого методу наведений нижче?

left=0;

right=N-1;

found=false;

while (left<=right && !found)

{ middle=(left+right)/2;

if (target<A[middle]) right=middle-1;

else if (target>A[middle]) left=middle+1; 

   else found=true; }

if (found) cout<<"Target found: A["<<middle+1<<"]="<<A[middle]<<endl;

else cout<<"Target not found"<<endl;

0%
0%
0%
0%
More questions like this

Want instant access to all verified answers on moodle.ontu.edu.ua?

Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!

Browser

Add to Chrome