Question

Write a recursive function in C called bunnyears that takes an integer n as a parameter and returns the total number of bunny ears. Each bunny has two ears. The function should use recursion to calculate the total number of bunny ears for n bunnies. What is the implementation of the bunnyears function?

Answer 1

To implement the bunnyears function in C, you can use recursion. The function takes an integer n as a parameter and returns the total number of bunny ears for n bunnies. It recursively reduces the number of bunnies by 1 in each call until the base case of 0 bunnies is reached.

Step-by-step explanation:

To implement the bunnyears function in C, you can use recursion. Here is the code:

#include<stdio.h>

int bunnyears(int n) {
// base case
if (n == 0) {
return 0;
}
// recursive case
else {
// each bunny has 2 ears
return 2 + bunnyears(n - 1);
}
}

int main() {
int n;
printf("Enter the number of bunnies: ");
scanf("%d", &n);
int totalEars = bunnyears(n);
printf("Total number of bunny ears: %d", totalEars);
return 0;
}

In this code, the bunnyears function takes an integer n as a parameter and returns the total number of bunny ears for n bunnies. The function uses recursion by reducing the number of bunnies by 1 in each recursive call until the base case of 0 bunnies is reached.