Question

13. Write an efficient recursive function that takes in a sorted array of numbers, two integers, low and high, representing indexes into the array, and another integer, value, and returns the index in the array where value is found in the array in between index low and high, inclusive. If value is NOT found in the array in between indexes low and high, inclusive, then the function should return -1. int search(int numbers[], int low, int high, int value){

          13. Write an efficient recursive function that takes in a sorted array of numbers, two integers, low and
high, representing indexes into the array, and another integer, value, and returns the index in the array
where value is found in the array in between index low and high, inclusive. If value is NOT found in the
array in between indexes low and high, inclusive, then the function should return -1.
int search(int numbers[], int low, int high, int value){

13. Write an efficient recursive function that takes in a sorted array of numbers, two integers, low and
high, representing indexes into the array, and another integer, value, and returns the index in the array
where value is found in the array in between index low and high, inclusive. If value is NOT found in the
array in between indexes low and high, inclusive, then the function should return -1.
int search(int numbers[], int low, int high, int value)

Added by Dawn Y.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Nicole Smina

Step 1

First, we need to check if the low index is less than or equal to the high index. If not, it means the value is not found in the array, so we return -1. Show more…

Show all steps

Thanks for your feedback!

13_ Write an efficient recursive function that takes in a sorted array of numbers, two integers (low and high) representing indexes into the array, and another integer (value), and returns the index in the array where the value is found between the indexes low and high (inclusive). If the value is not found in the array between the indexes low and high (inclusive), then the function should return -1. int search(int numbers[], int low, int high, int value) { // implementation goes here }