Write a function called st_dev. st_dev should have one
1 answer:
You might be interested in
The recursive function divBy3And5 is defined in Python and is found in the attached image.
In the base case, the function divBy3And5 tests if the input list is empty. If so, the tuple returned is . This means no numbers are divisible by three and no numbers are divisible by five.
The recursive step gets the first element of the list and
- If divisible by 3, it sets <em>count_of_3</em> to 1, else it leaves it as 0
- If divisible by 5, it sets <em>count_of_5</em> to 1, else it leaves it as 0
It then makes a recursive call on the remaining elements, and stores it in a variable as follows
<em>divBy3And5_for_remaining_elem</em> = divBy3And5(remaining_elements)
Then, it returns the tuple
(<em>divBy3And5_for_remaining_elem</em>[0] + <em>count_of_3</em>,
<em>divBy3And5_for_remaining_elem</em>[1] + <em>count_of_5)</em>
Learn more about recursion in Python: brainly.com/question/19295093
