The ________ Algorithm Uses Recursion to Sort an Array

Q1: The base case of a recursive function<br>A)

Q3: The quicksort algorithm works on the basis

Q4: Suppose that a recursive function with integer

Q5: A recursive function should be designed to

Q6: A _ function is one that calls

Q7: The programmer must ensure that a recursive

Q8: Recursion can be used to<br>A) compute factorials.<br>B)

Q9: The function int fact(int k)<br>{<br>Return k*fact(k-1);<br>If (k==0)

Q10: The QuickSort algorithm was developed in 1960

Q11: When a function A calls a function