The following code is an example of a __________ recursive algorithm. int myRecursion(int array[], int first, int last, int val)
{
int num;
if (first > last)
$\quad$ return -1;
num = (first + last) /2;
if (array[num] == val)
$\quad$ return num;
if (array[num] < val)
$\quad$ return myRecursion(array, num + 1, last, val) ;
else
$\quad$ return myRecursion(array, first, num - 1, val) ;
}

Question

The following code is an example of a __________ recursive algorithm. int myRecursion(int array[], int first, int last, int val)
{
int num;
if (first > last)
$\quad$return -1;
num = (first + last)/2;
if (array[num] == val)
$\quad$return num;
if (array[num] < val)
$\quad$return myRecursion(array, num + 1, last, val);
else
$\quad$return myRecursion(array, first, num - 1, val);
}
A) Towers of Hanoi
B) QuickSort
C) binary search
D) doubly linked list
E) None of these

Quizplus · Accepted Answer

The code is a binary search recursive algorithm that uses the divide-and-conquer strategy to search for a value in a sorted array. The algorithm recursively divides the array in half and compares the middle element to the target value until the value is found or the entire array has been searched.

The Following Code Is an Example of a __________ Recursive \quad

The Following Code Is an Example of a __________ Recursive $\quad$