Question: Consider a recursive function decToBin(decimal) that converts a decimal number to a binary representation but still in base 10. Note that all inputs and output
Consider a recursive function decToBin(decimal) that converts a decimal number to a binary representation but still in base 10. Note that all inputs and output are 32-bit integers.
Example outputs:
decToBin(7) = 111 (one hundred and eleven)
decToBin(23) = 10111 (ten thousand, one hundred and eleven)
decToBin(18) = 10010 (ten thousand and ten)
What is the recursive relation of the function decToBin?
Question options:
|
|
None of the other answers are correct |
|
|
T(n) = K + T(n/2) |
|
|
T(n) = K + T(n-2) |
|
|
T(n) = K + T(n/10) |
|
|
T(n) = K + T(n-1)
|
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
