Answer: False.
Explanation:
The general case of recursive function is when the solution is obtained recursively by simplification at each step.
However, it is the base case in a recursive function when the solution is obtained directly.
The general case must be reducible to base to arrive at a solution else the recursion would be a infinite recursion.
Explanation:
2.there will be 8 books left on the shelf if each child takes one
Answer:
50-64
Explanation:
We know this because I said so
He should use PowerPoint and the design should be feathered
So here is the code in Python:
n = 0.00 #this is a float because there are some numbers that are decimals.
while n < 20: #n which is 0.00 and while it is lower than 20 if runs the code below
n = n + 1 #it will add 1 to n everything it runs the code.
k = n / 2 #it will divide whatever n is everytime by 2
print(str(n) + '/2: ') # it's printing the number it's on
print(k) # prints the answer for the n.
You can change n to add by any, make n any num instead of 0.00 and you can change the while condition from n < 20 to any other logical statement. If you want to get creative you can take 2 inputs for numbers and make one of them the starting number and other one is the ending number. Also make sure to make n a number lower than you starting point because if you set n as your starting point then it will skip it.
