These are examples of good quiz text files to explain your answers.


quiz1.txt
---------
student name here

#1.
If a recursive function never returns, the system will eventually run out
of stack space and the process (program) will stop running.

#2.
A base case is solved immediately and requires no recursive calls.



quiz2.txt
---------
student name here

I believe there are two base cases in the binsearch function.

1. When the array is empty.
   The array can be reduced again and again until it has no more items.

2. When the value is found.

Otherwise, we recurse to search some more.