*JAVA Data Structures* Write a modification of the recursive function BinarySear
ID: 3856618 • Letter: #
Question
*JAVA Data Structures*
Write a modification of the recursive function BinarySearch() that prints out the sequence of array elements compared to the target.
// BinarySearch.java class BinarySearch { // binarySearch() // pre: Array A[p..r] is sorted static int binarySearch(int] A, int p, int r, int target){ int a if(p >r) return -1; else if(targetA[) else if(target A[q] return q return binarySearch(A, p, q-1, target) return binarySearch(A, q+1, r, target); public static void main(String[] args) { int[] B = {1,2,3,4,5,6,7,8,9,10); System.out.println(binarySearch(B, 0, B.length-1, 7)); System.out.println (binarySearch(B, 0, B.length-1, 2)); System.out.println(binarySearch (B, 0, B.length-1, 11));Explanation / Answer
modification of the recursive function :
class BinarySearch{
static int binarySearch(int[] A,int p,int r,int target){
int q;
if(p>r) {
return -1;
}else{
q = (p+r)/2;
if(target == A[q]) {
for(i=p;i<q;i++){//elements less than target
return A[i];}
}else if(target < A[q]){
return binarySearchh(A,p,q-1,target);
}else{
return binarySearch(A,q+1,r,target);
}
}
}
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.