Any Algorithm That Can Be Coded with Recursion Can Also

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

Q12: The _ of recursion is the number

Q14: The speed and amount of memory available

Q15: Indirect recursion means that a function calls

Q17: A recursive function cannot call a function

Q18: Recursive algorithms tend to be less efficient

Q25: When a recursive function directly calls itself,