Lab #6 Section 1 – Chapter 11 Write a program class called BinarySearch that has a static method called Search that searches the array a for key. If key is not in the array segment, then -1 is...

pdf programming


Lab #6 Section 1 – Chapter 11 Write a program class called BinarySearch that has a static method called Search that searches the array a for key. If key is not in the array segment, then -1 is returned. Otherwise returns an index in the segment such that key == a[index]. Precondition: a[first] <= a[first="" +=""><= ...=""><= a[last]. the search method takes an int array, index of first number in array, index of last number in array and key to search for in the array. section 2 – chapter 12 write a main program that uses the binarysearch class you created in section 1 to search for a value. your program will print key + " is at index " + result) if it finds the value or key + " is not in the array” if it does not find the value. a[last].="" the="" search="" method="" takes="" an="" int="" array,="" index="" of="" first="" number="" in="" array,="" index="" of="" last="" number="" in="" array="" and="" key="" to="" search="" for="" in="" the="" array.="" section="" 2="" –="" chapter="" 12="" write="" a="" main="" program="" that="" uses="" the="" binarysearch="" class="" you="" created="" in="" section="" 1="" to="" search="" for="" a="" value.="" your="" program="" will="" print="" key="" +="" "="" is="" at="" index="" "="" +="" result)="" if="" it="" finds="" the="" value="" or="" key="" +="" "="" is="" not="" in="" the="" array”="" if="" it="" does="" not="" find="" the="">