When you develop a recursive algorithm to operate on a data structure, what does the general case typically make smaller with each recursive call?
a. The number of elements in the structure
b. The number of times the variable is referenced
c. The distance to the end of the structure
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.