need help with this python question. why is -4? please explain clear on each steps thank you What would the output to thing(5) be, given the following function definition:def thing(n):if n == 1 or n == 2:return 2 * nelse:return thing (n1) - thing(n - 2)

Name: need help with this python question. why is -4? please explain clear o
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: need help with this python question. why is -4? please explain clear on each steps thank you What would the output to thing(5) be, given the following function definition:def thing(n):if n == 1 or n == 2:return 2 * nelse:return thing (n1) - thing(n -

the code you mentioned is called recursive function. def thing(n): if n==1 or n==2:…

Answered: need help with this python question.…

Engineering

Computer Science

need help with this python question. why is -4? please explain clear on each steps thank you

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter6: Modularity Using Functions

Section6.4: A Case Study: Rectangular To Polar Coordinate Conversion

Problem 9E: (Numerical) Write a program that tests the effectiveness of the rand() library function. Start by...

See similar textbooks

Similar questions

plz can you explain this for me thanks
Create a program that accepts an integer N, and pass it to the function generatePattern. generatePattern() function which has the following description: Return type - void Parameter - integer n This function prints a right triangular pattern of letter 'T' based on the value of n. The top of the triangle starts with 1 and increments by one down on the next line until the integer n. For each row of in printing the right triangle, print "T" for n times. In the main function, call the generatePattern() function. Input 1. One line containing an integer Output Enter N: 4 T TT TTT TTTT
float theRealQuestion (int x, float y) { int z; if (x > 15) z = x; else z = y; return z; } Code the function prototype for the given function.
Part (a) Write a python function that computes the binomial coefficient ("). The function should return the correct answer for any positive integer n and k where k=m pass Part (c) Suppose that the number of people in the trial is 100. Then: • Plot a curve that shows how the probability of type 1 error changes with the choice of m, for m = 1,...n assuming that the null hypothesis holds (in red), • On the same picture, plot the probability of type 2 error vs the value of m in the case in which the new drug is effective with proability 0.68 (in blue). You can plot the two curves using matplotlib.pyplot. You can select the color by passing color='r' or color='b' to the plt.plot() function. [4]: n - 100 # your code here def plot_curve (): pass [5]: plot_curve() Part (d) Based on the picture above, what value of m do you think would be suitable to keep both type 1 and type 2 error small at the same time? (You may assume that the company claims the new drug has 68% accuracy) [6]: # your…
Write a function which takes two integer parameters for values to be added together and returns the result by value. The function may not print anything or read anything directly from the user (i.e. no cin/cout in the function). Assume that the values passed to the function will not be negative, but could be 0 or positive, and will both be integers. The function must implement addition recursively, and cannot use the standalone + operator (only ++) or call any other functions.
Consider the following function that takes two positive integers x and y as its input parameters. This function is supposed to be a recursive function but it is not. Which option best describes the reason? |def recursive_function2(x, y): if x < ® and y < ®: return False else: result - sum([x, y]) result +- 10 return rec_function2(x-1, y-1) A recursive function must call itself. This function calls a function with a different name. There is nothing wrong with this recursive function. ) This function does not import any module to call the function sum() O A recursive function can only call itself and must not call any other function e.g., sum()
Programming Language :- C 7. A function is defined for a positive integer n as follows: 3n + 1, if n is odd f(n) = { n if n is even 2 We consider the repeated application of the function starting with a given integer n, as follows: f(n), f(f(n)), f(f(f(n))), It is conjectured that no matter which positive integer n you start from; this sequence eventually will reach to 1. If n = 13, the sequence will be 13, 40, 20, 10, 5, 16, 8, 4, 2, 1. Thus if you start from n = 13, you need to apply function 10 times to reach 1. Write a recursive function that takes n as an input number and returns how many times function f has to be applied repeatedly to reach 1.
Solution in java
Please write the code in Python
def square_number(x): return x * x print(square_number(square_number(square_number(2)))) What would this program do if instead the function definition had been: def square_number(x): print(x * x) Why?
Instructions: In the code editor, you are provided with a main() function that asks the user for a string and passes this string and the size of this string to a function call of the function, preserveString(). This preserveString() function has the following description: Return type - void Name - preserveString Parameters The string Length of the string Description - this is a recursive function that prints the string repeatedly. Each time it prints the string, it excludes the last character of the string until only one character is left. This preserveString() function has already been partially implemented. Your only task is to add the recursive case of this function. Please Finish the code ASAP: This is my current given code: #include<stdio.h>#include<string.h> #define STR_MAX_SIZE 100 void preserveString(char*, int); int main(void) { char str[STR_MAX_SIZE]; printf("Enter string: "); fgets(str, STR_MAX_SIZE, stdin); preserveString(str,…
function myCompose(f,g){// TODO: return (f o g);// that is, a function that returns f(g(x)) when invoked on x.}