What block(s) would most effectively keep a sprite from moving off the screen?
1 answer:
You might be interested in
Answer:
Explanation:
I do not have the files listed in the question so I have made two test files with the same names. This code is written in Python, we are assuming that the names on each file are separated by newlines.
f1 = open("GirlNames.txt", 'r')
f1_names = f1.read()
f1_names_list = f1_names.split('\n')
f2 = open("BoyNames.txt", 'r')
f2_names = f2.read()
f2_names_list = f2_names.split('\n')
print(f1_names_list)
print(f2_names_list)
boy_or_girl = input("Would you like to enter a boy or girl name or both: ").lower()
if boy_or_girl == 'boy':
name = input("Enter name: ")
if name in f2_names_list:
print("Yes " + name + " is in the list of most popular boy names.")
else:
print("No, it is not in the list")
elif boy_or_girl == 'girl':
name = input("Enter name: ")
if name in f1_names_list:
print("Yes " + name + " is in the list of most popular girl names.")
else:
print("No, it is not in the list")
elif boy_or_girl == 'both':
girlname = input("Enter Girl name: ")
if girlname in f1_names_list:
print("Yes " + girlname + " is in the list of most popular girl names.")
else:
print("No, it is not in the list")
boyname = input("Enter name: ")
if boyname in f2_names_list:
print("Yes " + boyname + " is in the list of most popular girl names.")
else:
print("No, it is not in the list")
else:
print("Wrong input.")
Answer:
No you can not tell that recursion is ever required to solve a problem.
Recursion is required when in the problem, the solution of the input depends on the solution of the subsets of the input.
Iteration is also another form of repetitive approach we follow to solve that kind of problems.
But the difference between recursion and iteration is :
- In recursion we call the function repeatedly to return the result to next level.
- In iteration certain bunch of instructions in a loop are executed until certain conditions met.
Explanation:
For example in the Fibonacci sequence problem, to find , we need to compute
and
before that.
- In case of recursion we just call the method Fibonacci(n) repeatedly only changing the parameter Fibonacci(n-1), that calculates the value and return it.
Fibonacci(n)
1. if(n==0 or n==1)
2. return 1.
3.else
4. return( Fibonacci(n-1)+Fibonacci(n-1) )
- But in case of iteration we run a loop for i=2 to n, within which we add the value of current
and
to find the value of
Fibonacci(n)
1. if(n<=2)
2. result = 1
3. else
4. result1 =1 and result2=1.
5. { result = result1 +result2.
6. result1= result2.
7. result2 = result.
8. }
9. output result.