Answer:
see explaination
Explanation:
import random
def number_guess(num):
n = random.randint(1, 100)
if num < n:
print(num, "is too low. Random number was " + str(n) + ".")
elif num > n:
print(num, "is too high. Random number was " + str(n) + ".")
else:
print(num, "is correct!")
if __name__ == '__main__':
# Use the seed 900 to get the same pseudo random numbers every time
random.seed(900)
# Convert the string tokens into integers
user_input = input()
tokens = user_input.split()
for token in tokens:
num = int(token)
number_guess(num)
Answer:
O(n²)
Explanation:
The worse case time complexity of insertion sort using binary search for positioning of data would be O(n²).
This is due to the fact that there are quite a number of series of swapping operations that are needed to handle each insertion.
The answer is (d.) A5:E5
In a worksheet, the cell is where you enter the information and the contents. It's an intersection of a row and a column in which column is identified by letters and numbers for row. Every cell has a name based on the column and row intersection. For example an intersection from column A and Row 5 is called A5. Cell range refer to a group of cells. They are named after the first and the last cell separated by a colon.
The CPU is also known as the system unit.
Use the equation I=prt where interest = principal times rate times time.
Fill it out, it becomes I= 48000(.05)(5)
I= 12000
