Question: In C design a RECURSIVE algorithm called isDivisible(number, divisor) This function will return true (return 1) if any of the digits in the number is
In C design a RECURSIVE algorithm called isDivisible(number, divisor) This function will return true (return 1) if any of the digits in the number is divisible via the divisor. Otherwise this function will return false (return 0) Assume that number, and divisor are positive integers. YOU CANNOT USE GLOBAL VAR OR ADDITIONAL PARAMS/FUNCTIONS Exampe: isDivisible(69, 2) would return false, but isDivisible(69, 3) would return true
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
