The code is already given above. Problem: Using PYTHON, create a code that asks you to enter three numbers: a, b, and x. Create a recursive function that takes in 3 inputs and prints the multiples of x in the range [a,b] V a and b will serve as lower and upper bounds of the range where the multiples of x will be searched on. v if x is odd, print the multiples in ascending order. v if x is even, print the multiples in descending order. The value of input a will always be less than or equal to input b. The difference between a and b will be limited to a maximum of 200 to avoid Python's "maximum recursion depth exceeded in comparison" error. Example of Ouput #1 Example of Input #2 Example of Output #3 Please enter a: -10 Please enter b: 10 Please enter a: 1 Please enter b: 10 Please enter x: 2 10 8 6 4 2 Please enter a: 1 Please enter b: 2 Please enter x: 3 -9 -6 -3 0 369 Please enter x: 7

The code is already given above. Problem: Using PYTHON, create a code that asks you to enter three numbers: a, b, and x. Create a recursive function that takes in 3 inputs and prints the multiples of x in the range [a,b] V a and b will serve as lower and upper bounds of the range where the multiples of x will be searched on. v if x is odd, print the multiples in ascending order. v if x is even, print the multiples in descending order. The value of input a will always be less than or equal to input b. The difference between a and b will be limited to a maximum of 200 to avoid Python's "maximum recursion depth exceeded in comparison" error. Example of Ouput #1 Example of Input #2 Example of Output #3 Please enter a: -10 Please enter b: 10 Please enter a: 1 Please enter b: 10 Please enter x: 2 10 8 6 4 2 Please enter a: 1 Please enter b: 2 Please enter x: 3 -9 -6 -3 0 369 Please enter x: 7

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

Consider a network of streets laid out in a rectangular grid, In a northeast path from one point in the grid to another, one may walk only to the north (up) and to the east (right). Write a program that must use a recursive function to count the number of northeast paths from one point to another in a rectangular grid. Your program should prompt the user to input the numbers of points to the north and to east respectively, and then output the total number of paths. Notes: 1. Here is a file (timer.h download and timer.cpp download) which should be included in your program to measure time in Window or Unix (includes Mac OS and Linux) systems (use start() for the beginning of the algorithm, stop() for the ending, and show() for printing). 2. The computing times of this algorithm is very high, and the number of paths may be overflow, don't try input numbers even over 16. 3. Name your recursive function prototype as calcPath(int north, int east) to ease grading. 4. Paste your output
language: Python Problem: 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. On top of writing the function, also write a test case for the function to prove the program works.
Write a python program with the following functions:1. the function factorial_loop(num) that takes an integer num and returns the value of the factorial of num written as num!, where num! = num * (num-1) * (num-2) * … * 2 * 1. This function must use a loop (iteration) to compute the value of num!.2. the function factorial_recursive(num) that takes an integer num and returns the value of the factorial of num (i.e., num!) as defined above. This function must use a recursive algorithm to compute the value of num!.
1. Copy the countdown function from Section 5.8 of your textbook. def countdown(n): if n <= 0: print('Blastoff!') else: print(n) countdown(n-1) Write a new recursive function countup that expects a negative argument and counts “up” from that number. Output from running the function should look something like this: >>> countup(-3)-3-2-1Blastoff! Write a Python program that gets a number using keyboard input. (Remember to use input for Python 3 but raw_input for Python 2.) If the number is positive, the program should call countdown. If the number is negative, the program should call countup. Choose for yourself which function to call (countdown or countup) for input of zero. Provide the following. The code of your program. Respective output for the following inputs: a positive number, a negative number, and zero. An explanation of your choice for what to call for input of zero. 2. Write your own unique Python program that has a…
language: Python Problem: Write a recursive function to add a positive integer b to another number a, add(a, b), where only the unit 1 can be added, For example add(5, 9) will return 14. When creating the function, also create a test case to prove the program works. The pseudocode is: # Base case: if b is 1, you can just return a + 1# General case: otherwise, return the sum of 1 and what is returned by adding a and b - 1
Design a program using pseudo code to read two numbers (exponent and base) using a function called getNumber, then pass these values to another function called NumExponent which uses recursion to calculate the power and return appropriate result.
create a function named powerHalf(x, n), where this function is recursive like power(x, n), but it also uses the idea that xn = (x n/2)2 when n is even. Use the global variable countcalls to verify that this version of the power function is more efficient than power(x,n), where n is 0 or a positive integer with the base case that: xn = x * xn-1 use python please
Write a recursive function in correct Python syntax that returns the reverse of an integer, n. For example, if n=1234 (an integer) the function would return 4321 (an integer). Use good coding style. There are many different ways to write this function (e.g., using strings to assist you, etc). Here's the function's header to get you started: def reverse(n):
Write a program that asks a number “N” from user. Write a function that takes this number “N”, then returns the sum of numbers starting from N to 1. Use this function in your program and show the results. Be careful, your function should be recursive! I need code on C programming
Write a C++ program where the user inputs two positive integers, A and B, where 5≤ A ≤10 and 20≤ B ≤30. (use user defined functions) A function to output AB (where A is multiplied by itself B times) do not use the built in “pow” function, use your own function. A function that returns the area of a rectangle of height A and width B. A function that returns the sum of odd numbers between A and B. A function to calculate AB recursively. Knowing that AB = AB-1 * A with base case A0 =1
I need help with this Python coding question. Design a function that uses recursion to raise a number to a power. The function should accept two arguments: the number to be raised and the exponent. Assume that the exponent is a nonnegative integer.
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;}