Multiple Choice
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)
return -1;
num = (first + last) /2;
if (array[num] == val)
return num;
if (array[num] < val)
return myRecursion(array, num + 1, last, val) ;
else
return myRecursion(array, first, num - 1, val) ;
}
A) Towers of Hanoi
B) QuickSort
C) binary search
D) doubly linked list
E) None of these
Correct Answer:

Verified
Correct Answer:
Verified
Q8: The QuickSort algorithm was developed in 1960
Q9: If a recursive algorithm does not contain
Q10: The QuickSort algorithm works on the basis
Q11: A _ function is one that calls
Q12: The speed and amount of memory available
Q14: Any algorithm that can be coded with
Q15: All mathematical problems are designed to be
Q16: Indirect recursion means that a function calls
Q17: Recursive algorithms are less efficient than iterative
Q18: How many times will the following