Answer:
does anybody know this answer?
Explanation:
no nobody does
Answer:
Check the explanation
Explanation:
# Step 1
the first thing to execute will be......
f = open("states.txt")
# Step 2
the second step is......
states = []
for line in f:
states.append(line.strip())
# Step 3:
the third step is to......
for state in sorted(states):
print(state)
f.close()
False. you can make different slides have different transitions
Answer:
b. The names in the list should be in alphabetical order.
Explanation:
A binary search is an algorithm used for searching for an item in a list or array. The algorithm first sorts the data structure into order and then divides it into halves. If the searched item is less than the middle item in the list, then the algorithm searches for the target in the first half, else, in the second half. This reduces the time complexity of the search.
Answer: ANSWER is B I'm pretty sure
Explanation: hope this help
s :)
