Each of the following code snippets finds the value target in a sorted list lst . Which is using divide and conquer? If you spot any errrors in the code, ignore them and answer for a corrected version of that snippet.

Question

Each of the following code snippets finds the value  target  in a sorted list  lst .  Which is using divide and conquer?  If you spot any errrors in the code, ignore them and answer for a corrected version of that snippet.

Answer

int top = target.length-1; 
 int bottom = 0; 
 int next = 0; 
 while (next != target){ 
   if (next > target){ 
     bottom++; 
   } else { 
     top--; 
   }  
   next = bottom - top; 
 }

Answer

int top = target.length-1; 
 int bottom = 0; 
 int next = 0; 
 while (next != target){ 
   if (next > target){ 
     bottom++; 
   } else { 
     top--; 
   }  
   next = (top - bottom)/2; 
 }

Answer

int top = target.length-1; 
 int bottom = 0; 
 int next = 0; 
 while (next != target){ 
   if (next > target){ 
     bottom--; 
   } else { 
     top++; 
   }  
   next = (top - bottom)/2; 
 }

Answer

int top = target.length-1; 
 int bottom = 0; 
 int next = top/2; 
 while (next != target){ 
   if (next > target){ 
     bottom = next; 
   } else { 
     top = next; 
   }  
   next = (top - bottom)/2; 
 }

Crowdly

Each of the following code snippets finds the value target in a sorted list l...

Want instant access to all verified answers on ilearn.mq.edu.au?