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



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 time complexity of decToBin? O(2n) None of the other answers are correct O(1) O(n) O(logn) 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) Which of the following is a valid base case for the recursive function decToBin? decimal
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
