0
/ 50
Given an array of int
s, compute recursively the number of times that the value 11 appears in the array (no loops). We'll use the...
Given an array of int
s, compute recursively the number of times that the value 11 appears in the array (no loops). We'll use the convention of considering only the part of the array starting at the given index and going to the end. In this way, a recursive call can pass index + 1
to move down the array. The initial call will pass in an index
value of 0.
Your feedback will appear here when you check your answer.