Question: Question 16 (2 points) The following code to perform a binary search on an ordered array of integers has a bug. Identify the bug (specify

Question 16 (2 points) The following code to perform a binary search on an ordered array of integers has a bug. Identify the bug (specify the line number) and write a corrected version of the incorrect line. The method should return the index where the value was found, or -1 if the value is not found. 1 public static int search (intll list, int valueToFind) f int left 0, middle, right list . length-1, results-1; while (left > right result--!){ middle (lefttright)/2: if (list [middle] valueToFind) == result = middle; else if (list[middle]
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
