Which of the following is NOT a rule to ensure a correct rec
Which of the following is NOT a rule to ensure a correct recursive function? Each stopping case must perform a correct action (or return the correct value for stopping case) for the condition that involves it. The chain of recursive calls eventually must reach one of the stopping cases. For cases that involve recursion. If each recursive calls correctly solve the subproblem or return the correct value for the subproblem it solve, then the final The size of the problem solved by the successive recrusions must each be larger than the last.
Solution
question 11)
the size of the problem solved by the successive recursions must each larger than the last
this rule is not to ensure the correct recursion
some time the size of the problems may increase or decrease an may not be.
example quick sort algortihm
