Answer:
Its word count so she knows how much words she is writing
Explanation:
largest = int(input("Enter a number: "))
print("Largest: {}".format(largest))
i = 0
while i < 5:
num = int(input("Enter a number: "))
if num > largest:
largest = num
print("Largest: {}".format(largest))
i += 1
I hope this helps!
num%2==1
The modulo operator (%) divides the left hand side by the right hand side and returns the remainder. When dividing an odd number by 2 there will always be a remainder of 1.
Answer:
The solution code is written in Python:
- def add_spaces(s):
- if len(s) < 2:
- return s
- else:
- return s[0] + " " + add_spaces( s[1 : ] )
Explanation:
Recursive function is a function that will call itself within the same function.
Let create a function named add_spaces() that take one input string, s (Line 1).
Next, create an if condition to check if the length of the input string is less than 2 (this means if the string has only one character), return the current string (Line 2-3).
Otherwise, it should return the first character of string, s[0] concatenated with a single space " " and concatenated again with the return output from the recursive calling add_spaces() that take s[1: ] as input parameter (Line 4-5). Please note s[1: ] is an expression we get the substring of the current string from position 1 till the end of string.
