jestion 8 Consider a recursive function decTOBin(decimal) that converts a decimal number to a binary representation b till 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 O(logn) O(2^n) None of the other answers are correct O O(n) O(1)

jestion 8 Consider a recursive function decTOBin(decimal) that converts a decimal number to a binary representation b till 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 O(logn) O(2^n) None of the other answers are correct O O(n) O(1)

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 8SA

See similar textbooks

Similar questions

Note: Solve using c++ Write a recursive function to get count of a specific character in given string or array ofcharacters.Prototype of Function: int getCharCount(const char* ptr, char c)Input: const char* ptr=” wavelength”, char c=’e’Output: 2 (as ‘e’ occurs two times in the “wavelength”)
(C Language) Write a recursive function called PrintNumPattern() to output the following number pattern. Given a positive integer as input (Ex: 12), subtract another positive integer (Ex: 3) continually until a negative value is reached, and then continually add the second integer until the first integer is again reached. For this lab, do not end output with a newline.
For function decToBinary, write the missing parts of the recursion case. This function should return a string that stores the binary equivalent for int variable num. Example: The binary equivalent of 13 may be found by repeatedly dividing 13 by 2. So, 13 in base 2 is represented by the string "1101". Examples: decToBinary(13) -> "1101" public String decToBinary (int num) { if (num < 2) return Integer.toString(num); else return <<Missing recursive call>> + <<Missing calculation>>;}
Need help with this c++ recursive function: Write the function starCrossed() which computes (recursively, with no loops) a new string where identical characters that are adjacent in the original string are separated from each other by a "*". Here are some examples: starCrossed("hello") returns "hel*lo" starCrossed("xxyy") returns "x*xy*y" starCrossed("aaaa") returns "a*a*a*a"
Write a recursive function that, given a sequence of comparable values, returns the count of elements where the current element is less than the following ( next ) element in the given sequence. See the examples given below. def count_ordered ( seq ) : """ Input : A sequence of comparable elements Output : The number of elements that are less than the following element in the sequence Example : >>> count_ordered ( [ 1 , 2 , 3 , 4 , 5 , 6 ] ) 5 >>> count_ordered ( ( 1 , 12, 7.3 , -2,4 ) ) 2 >>> count_ordered ( 'Python' ) 2 >>> count_ordered ( [ 6 ] ) 0 >>> count_ordered ( [ ] ) 0 """ In the first example above , count_ordered ( [ 1,2,3,4,5,6 ] )the returned answer is 5 because for all the first 5 numbers the current number is less than the next number. In the second example above, count_ordered ( ( 1,12,7.3 , -2,4 ) )the…
c++ Implement a function that recursively calculates the nth number in the Fibonacci sequence of numbers. The Fibonacci sequence starts at 0 and 1. Each number thereafter is the sum of the two preceding numbers. This gives us the following first ten numbers: 0,1,1,3,5,8,13,21,34, .... Input Expected output0 01 17 139 34
The 4th problem mimics the situation where eagles flying in the sky can be spotted and counted.FindEagles: a recursive function that examines and counts the number of objects (eagles) in aphotograph. The data is in a two-dimensional grid of cells, each of which may be empty (value 0) orfilled (value 1 to 9). Maximum grid size is 50 x 50. The filled cells that are connected form an object(eagle). Two cells are connected if they are vertically, horizontally, or diagonally adjacent. Thefollowing figure shows 3 x 4 grids with 3 eagles. 0 0 1 21 0 0 01 0 3 1 FindEagle function takes as parameters the 2-D array and the x-y coordinates of a cell that is a part ofan eagle (non-zero value) and erases (change to 0) the image of an eagle. The function FindEagleshould return an integer value that counts how many cells has been counted as part of an eagle and havebeen erased. The following sample data has two pictures, the first one is 3 x 4, and the second one is 5 x 5 grids. Notethat your program…
Problem 6: Induction and Recursion Consider a postal system for which the minimum postage required for any service (e.g. mailing a postcard) is 18 cents. [a] Prove by strong induction that any postage ≥ 18 can be formed using only 4-cent and 7-cent stamps. (Hint: consider bases cases for 18 thru 21.) [b] Write a Java/Python-like pseudocode for a function that determines the number of each denomination of stamp for a postage amount ≥ 18. (It need not be concerned with lesser cases as they are never used).