Question: JAVA USING RECURSION & time complexity Q2 [10 pts] A positive integer is entered through the keyboard, write function decimalToBinary to find the binary equivalent
Q2 [10 pts] A positive integer is entered through the keyboard, write function decimalToBinary to find the binary equivalent of this number using recursion. For example, if input is 156, then binary value is 10011100 do not use iterations. 2 156 Remainder 278 239 29 219 24 22 21 15610 = 100111002 OO What is the time complexity for your function? Show your work
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
