The QuickSort Algorithm Was Developed in 1960 by

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)

Q11: When a function A calls a function

Q12: The _ of recursion is the number

Q13: Any algorithm that can be coded with

Q14: The speed and amount of memory available

Q15: Indirect recursion means that a function calls