Scheme number computer a Write a recursive procedure digits

Scheme number computer a. Write a recursive procedure (digits n) that computes the number of digits in the integer n using a recursive process. For example, (digits 42) should return 2 and (digits 13579) should return 5. You may make use of the built in floor predicate for truncating decimals to whole numbers. b. Rewrite your procedure from part (a) using an iterative process. Call the function (digits-iter n).

Solution

Answer:

#include <stdio.h>
int digitcountprocedure(int read)
{
static int increment=0;

if(read>0)
{
increment++;
digitcountprocedure(read/10);
}
else
{
return increment;
}
}
int main()
{
int input;
int increment=0;

printf(\"Enter a positive integer input: \");
scanf(\"%d\",&input);

increment=digitcountprocedure(input);

printf(\"Total number of digits for entered number %d is: %d\ \",input,increment);

return 0;
}