An alternative strategy for the expo function uses the following recursive definition: expo(number, exponent) = 1, when exponent = 0 = number * expo(number, exponent – 1), when exponent is odd = (expo(number, exponent // 2)) ** 2, when exponent is even Define a recursive function expo that uses this strategy, and state its computational complexity using big O notation. Note: The program should output in the following format: 0 1 1 2 2 4 3 8 4 16 --------------------------------------------------------------------------------- def expo(base, exponent): expo.calls += 1 # Used to track recursive call count # Write you recursive expo function here expo.calls = 0 def main(): """Tests with powers of 2.""" for exponent in range (5): print(exponent, expo(2, exponent)) if __name__ == "__main__": main()

An alternative strategy for the expo function uses the following recursive definition: expo(number, exponent) = 1, when exponent = 0 = number * expo(number, exponent – 1), when exponent is odd = (expo(number, exponent // 2)) ** 2, when exponent is even Define a recursive function expo that uses this strategy, and state its computational complexity using big O notation. Note: The program should output in the following format: 0 1 1 2 2 4 3 8 4 16 --------------------------------------------------------------------------------- def expo(base, exponent): expo.calls += 1 # Used to track recursive call count # Write you recursive expo function here expo.calls = 0 def main(): """Tests with powers of 2.""" for exponent in range (5): print(exponent, expo(2, exponent)) if name == "main": main()

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 12PE

See similar textbooks

Related questions

Q: Find the logic error(s) in the following recursive function, and explain how to correct it (them).…

A: def sum(n): if n == 0: return 0 else: return n + sum(n) Logical errors are If n ==…

Q: Write a function that takes one integer parameter, makes sure it is an integer, prints sum of every…

A: function sum(int number, int temp) Start if temp < 1 then return 1 else then display number "+"…

Q: In this chapter, the rules given for calculating the factorial of a number are as follows:If n = 0…

A: Best case is the one where the function returns the value without making any recursion calls. Thus…

Q: Write a recursive function called draw_triangle() that outputs lines of '*' to form a right side up…

A: Coded in Python 3.

Q: Write a recursive function print that, given an integer number p > 0, prints counting forward from 1…

A: #include<iostream>using namespace std;//recursive functionvoid print(int p){ //base…

Q: Write a recursive function that returns a value of 1 if its string argument is a palindrome and zero…

A: Python code to check whether the string is palindrome or not Code def sentencePalindrome (s):…

Q: Given this recursive function: unsigned long secret(unsigned long x, unsigned long y) { if(y < 0)…

A: This question is from the c++ programming language. Here a secret() function is given that is taking…

Q: Replace in recursive function all " 9 " with " 0 " in un input integer

A: Required: a program to Replace in recursive function all " 9 " with " 0 " in an input integer…

Q: Consider the recursive procedure which computes the nth Fibonacci number is the one below. procedure…

A: # Function for nth Fibonacci number def Fibonacci(n): if n<0: print("Incorrect input")…

Q: Write a recursive function to implement the recursive algorithm (determining the number of ways to…

A: Recursion is a computer programming process in which a function repeatedly calls itself during its…

Q: : Exponential Series is a series which is used to find the value of e. The formula us express the…

A: Given an exponential series which is used to calculate the value of ex. We need to write a C program…

Q: Write a recursive function (compute1(n) ) that takes one parameter and implements the following…

A: Compute.h file: #ifndef mainH #define mainH int compute1(int n); #endif Screenshot:

Q: Find the logic error(s) in the following recursive function, and explain how to correct them. This…

A: Please check the step 2 for solution

Q: For glass box testing of a recursive function, you should test cases where: a) the function returns…

A: Solution :: Let's see first that what is glass box testing? Answer :: Glass box testing is a…

Q: نقطتان )2( complete the identified statement such that the recursive function .funx(n+1) =…

A: Recursion means a function calling itself. Here in the given function, we have to fill the else…

Q: 1. What is the possible output if this recursive function run if x is 5 and y is 2. static int…

A: We need to find the output when fun1 is called with x=5, y=2. ***As per the guidelines, only 1st…

Q: g(x) = g(x - 1) * g (x - 3) if x is even and x > 3 = g(x - 2) if x is odd and x > 3 = x…

A: The base case is when X is less than or equal to 3 and in all other cases we call the function…

Q: IMPORTANT: Read the question carefully. This is as much an exercise in paying attention to specs as…

A: Please find the answer below :

Q: Elena complains that the recursive newton function in Project 2 includes an extra argument for the…

A: code:

Q: The Polish mathematician Wacław Sierpiński described the pattern in 1915, but it has appeared in…

A: The, code has given below:

Q: The function R (q; n) is defined as (equation-1), In this case, any sum of H (p; n) in equation-2…

Q: Consider the following recursive function: { a if b = 0, %3D f(b, a) 1 f(6, 2. (a f(a, b) if b > a >…

A: Answer is given below .

Q: We define the following recursive Python function: def cool(n): if n==0: return 2 if n==1: return 1…

A: Given To do the python program using dynamic programming. def cool(n): if n==0: return 2…

Q: Write a recursive function named multiply that takes two positive integers as parameters and returns…

A: def multiply(a, b): if b == 0: return 0 if b == 1: return a return a +…

Q: Write the definition of a recursive function int simpleSqrt(int n) The function returns the integer…

A: Here,we know about recursive function.And Also know about how recursive algorithm work. Int…

Q: complete the identified statement such that the recursive function funx(n+1) = n*funx(n-1), any…

A: Define header file <iostream> for io operations. Define function funx with parameter n. Use if…

Q: The sequence {an} is defined recursively by the equation: п(п — 1)а, — (n - 1)(n — 2)а,- - (п —…

A: PROGRAM INTRODUCTION: Include the required header files. Start the definition of the main function.…

Q: our main task is to write a recursive function sierpinski() that plots a Sierpinski triangle of…

A: Given: Sierpinski.java // Height of an equilateral triangle with the specified side length.…

Q: Write a recursive function called print_num_pattern() to output the following number pattern. Given…

A: Python is an interpreted, object oriented , dynamic type , scripting programming language. Python…

Q: language: Python Problem: Write a function log2(x), which gives an integer approximation of…

A: Below is the function in python and sample output:

Q: Write a recursive function that receives an integer consisting of any number of digits. Your…

A: Write a recursive function that receives an integer consisting of any number of digits. Your…

Q: Define a recursive function that will return the sum of the squares of each integer from N down to…

A: I have written the code in step 2 as well as I have uploaded the image of the program with its…

Q: Consider the following function (assume n is non-negative): public static int factorial(int n) { if(…

A: a) it is goes into infinite loop because if you pass non-negative argument number then , it will…

Q: 8. Know how to do these, to trace functions like these and to debug functions like these: //…

A: Q1) //print power of a number

Q: Write a recursive function body to find the nth term of Fibonacci Series. [Write only recursive…

A: In this question, the coding language is not specified then we are doing this question in the C…

Q: In programming, a recursive function calls itself. The classical example is factorial(n), which can…

A: Note:The Question contains many exercises .Since it is not mentioned which exercise has to be solved…

Q: Write a recursive function to implement the recursive algorithm (multiplying two positive integers…

A: Below is the C++ program in which the function is implemented to find the product of two numbers by…

Q: Write a recursive function called print_num_pattern() to output the following number pattern. Given…

Q: Write a recursive function, reverseDigits, that takes an integer as a parameter and returns the…

A: RECURSIVE FUNCTION: int rev_dig = 0; int base_pos = 1; //Recursive function int reverseDigits(int n)…

Q: 1. Identify the base case in the mylen recursive function below then convert the function into an…

A: Base case is the case where recursion stop and it is also independent. Like in mylen function base…

Q: Write a statement that calls the recursive function backwards_alphabet() with input starting_letter.…

A: Actually, python is a easiest programming language. It is a dynamically typed programming language.…

Q: Write a recursive function named sumSquares that returns the sum of the squares of the numbers from…

A: code: #include<iostream> #include<cstdlib> using namespace std; //function definition…

Q: Define a Recursive function that will compute the factorial of N. The factorial of N is define as…

A: Factorial of n is the product of all positive descending integers.

Q: Can someone explain how this recursive function output is 12? Recursion is hard for me

A: Thank you __________ print(R(0)) So here it will go to def R(n): So if 0>=5 false so it…

Concept explainers

Declaring and Defining the function

A set of statements, which performs a particular task is called a function. The program gains modularity by using function. The application is quite easy to understand, read, and edit when they are created with functions. The developer/programmer creates a function and uses main() to call the function. Once the function gets executed, the control is transferred to the main program.

Question

An alternative strategy for the expo function uses the following recursive definition:

expo(number, exponent) = 1, when exponent = 0 = number * expo(number, exponent – 1), when exponent is odd = (expo(number, exponent // 2)) ** 2, when exponent is even

Define a recursive function expo that uses this strategy, and state its computational complexity using big O notation.

Note: The program should output in the following format:

0 1

1 2

2 4

3 8

4 16

---------------------------------------------------------------------------------

def expo(base, exponent):

expo.calls += 1 # Used to track recursive call count

# Write you recursive expo function here

expo.calls = 0

def main():

"""Tests with powers of 2."""

for exponent in range (5):

print(exponent, expo(2, exponent))

if __name__ == "__main__":

main()

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Basic

VIEW

Solution

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Write a recursive function that returns a value of 1 if its string argument is apalindrome and zero otherwise.* Note that for the function parameters, you need to accommodate for the shrinkingstring, so that the string shrinks both from beginning and end after each recursive call.** Think about the simple cases or base cases. The 2 base cases have conditions thatwould return 0 and return 1 independently.For the palindrome, create a driver program. First ask the user to enter anystring through the keyboard. Then remove all the spaces and punctuations from thestring. Also, remove any letter capitalization from the string. Finally, pass the string tothe palindrome function through a function call.
Given two integers x snf y, the following recurrsive definition determined the greatest common divisor of x and y, Write gcd(xy). Write a recursive function, gcd, that takes two integers as parameters and returns the greatest commmon divisorof numbers.Also write a program to test your function. Write a recursive function,reverseDigits, that takes an integer as a parameter snd returns the number with the digits reversed. Also write a program to test your application.
In this lab, we will practice: Implementing recursive function printing in a recursive function (before and after the recursion function call) working on setting the base and general cases for the recursion function Instructions Write a recursive function called print_num_pattern() to output the following number pattern. Given two positive integers as input (Ex: 12 3), subtract the second integer (3) from the first one (12) and print the result continually until 0 or a negative value is reached. Then continually print the result of the addition of the second integer to the last value you reached from the subtraction (zero or negative) until the first integer is reached again. Note: For this lab, do not end output with a newline. Ex. If the input is: 12 3 the output is: 12 9 6 3 0 3 6 9 12 Hint You do not need to actually do addition. You can write statements i.e. printing statements after the recursion function call.
Write a recursive function called print_num_pattern() to output the following number pattern. Given a positive integer as input (Ex: 12), subtract another positive integer (Ex: 3) continually until 0 or a negative value is reached, and then continually add the second integer until the first integer is again reached. For coding simplicity, output a space after every integer, including the last. Do not end output with a newline. Ex. If the input is: 12 3 the output is: 12 9 6 3 0 3 6 9 12 # TODO: Write recursive print_num_pattern() function if __name__ == "__main__": num1 = int(input()) num2 = int(input()) print_num_pattern(num1, num2)if (num1<=0): print(num1,end= '')
(Using the programming language C, answer the following question) Write recursive C functions to do the following: Example: int summ(int n) returns the summation of integers from 0 to n. Here is the code. int summ(int n) { if(n < 0) return -1; if(n == 0) return 0; return n + summ(n - 1);} 1) If n is less than 0, the expression int bunnyEars(int n) returns -1; otherwise, it returns the number of ears for n bunnies. int factorial(int n) returns -1 if n is less than 0, otherwise returns the factorial of n. If n is greater than or equal to 0, the expression int fib(int n) returns -1; otherwise, it returns fib of n - 1 + fib of n - 2. (This will run quite slowly if you test it with more than roughly 50 digits.). int posPow(int base, int exp) returns -1 if exp is less than 0, otherwise returns base raised to the power exp. Write a main() that tests all the other functions thoroughly.
A recursive function is a function defined in terms of itself via self-referential expressions. This means that the function will continue to call itself and repeat its behavior until some condition is met to return a result. Write a complete python program that includes a recursive python method, sumThem which accepts an argument, n, sums all the odd, or all the even, positive integers up to n*3, depending on whether n*3 is odd or even. The number should be entered by the user You should include in your answer a screenshot that shows the program and the output for the value n*3 where n must be equal your last ID digit. For example, if your ID is 201314151617, then 7 will be entered, and the calculations should be applied to 21. Expected Output Sample: Enter the number: 0 The sum of even numbers up to 0 will be: 0
Write a recursive function definition for the following function: int squares(int n); //Precondition: n >= 1 //Returns the sum of the squares of numbers 1 through n. For example, squares(3) returns 14 because 12 + 22 + 32 is 14.
please code in python Here is another recursion example, but with less guidance. Write a function log2(x), which gives an integer approximation of the log base 2 of a positive number x, but it does so using recursion. Use a base case where you return 0 if x is 1 or less. In the general case, add 1 to the answer and divide x by 2. (This is purposely vague so you can figure it out yourself.)
Please explain what the recursive function will do. This function takes a stringargument (str), and two integer arguments: i – the first position in the string; and x – thelast position in the string. Please show output and recursive trace of Mystery(“abbba”, 0, 4), Mystery (“acca”, 0, 3), Mystery (“abcd”, 0, 3) Public Static boolean Mystery(string str, int i, int x)[ if(i >= x) return true; else if(str[i] != str[x]) return false; else return Mystery (str, i+1, x-1); }
The Polish mathematician Wacław Sierpiński described the pattern in 1915, but it has appeared in Italian art since the 13th century. Though the Sierpinski triangle looks complex, it can be generated with a short recursive function. Your main task is to write a recursive function sierpinski() that plots a Sierpinski triangle of order n to standard drawing. Think recursively: sierpinski() should draw one filled equilateral triangle (pointed downwards) and then call itself recursively three times (with an appropriate stopping condition). It should draw 1 filled triangle for n = 1; 4 filled triangles for n = 2; and 13 filled triangles for n = 3; and so forth. API specification. When writing your program, exercise modular design by organizing it into four functions, as specified in the following API: public class Sierpinski { // Height of an equilateral triangle whose sides are of the specified length. public static double height(double length) // Draws a filled equilateral…
In C++ 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 0 or 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. Ex. If the input is: 123 the output is: 12 9 6 3 0 3 6 9 12 #include <iostream> using namespace std; // TODO: Write recursive PrintNumPattern() function int main(int argc, char* argv[]) { int num1; int num2; cin >> num1; cin >> num2; PrintNumPattern(num1, num2); return 0;}
Write a recursive function that returns the sum of the digits of an integer.int sumOfDigits(int x);