Question: Consider a recursive function de cToBin (decimal) that converts a decimal number to a binary representation but still in base 10 . Note that all



Consider a recursive function de cToBin (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? T(n)=K+T(n/2)T(n)=K+T(n2)T(n)=K+T(n/10) None of the other answers are correct T(n)=K+T(n1) Consider the function below to reverse the substring of S from position i to j. If S were defined as a string "abcdefg" then reverseString ( S,0, len (S)1 ) function would return "gfedcba" Function: reversestring (S, int i, int j) if (i
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
