Question: Write a recursive method for computing a string with the binary digits of a number. If n is even, then the last digit is 0.
Write a recursive method for computing a string with the binary digits of a number. If n is even, then the last digit is 0. If n is odd, then the last digit is 1. Recursively obtain the remaining digits.
Step by Step Solution
3.38 Rating (157 Votes )
There are 3 Steps involved in it
public static String ... View full answer
Get step-by-step solutions from verified subject matter experts
