- The array data of integers is sorted in an increaning order- - The i.pdf
0 likes8 views
The document describes a binary search algorithm for finding the index of a target integer in a sorted array. It specifies that the search returns the index if the element is found and -1 if not. The function is to be implemented with a provided structure in Java.
1 of 1
Download to read offline
![- The array data of integers is sorted in an increaning order. - The input argunent target in the
value that in nought in data. - binarysearch should return the index of the element found in data
or - 1 if target is not present. - The initial call is binarysearch (data, target, 0, data-langth - 1). -
You aro given 15 blank lines (numbered below) to enter your code, which is more than is
needed. public atatic int binarySearch(int[] data, int target, int low, int high) f , Il Start of your
Java code](https://image.slidesharecdn.com/thearraydataofintegersissortedinanincreaningorder-thei-230311015911-2bd0d8f7/85/The-array-data-of-integers-is-sorted-in-an-increaning-order-The-i-pdf-1-320.jpg)
- The array data of integers is sorted in an increaning order- - The i.pdf
- 1. - The array data of integers is sorted in an increaning order. - The input argunent target in the value that in nought in data. - binarysearch should return the index of the element found in data or - 1 if target is not present. - The initial call is binarysearch (data, target, 0, data-langth - 1). - You aro given 15 blank lines (numbered below) to enter your code, which is more than is needed. public atatic int binarySearch(int[] data, int target, int low, int high) f , Il Start of your Java code