Answer:
classic A4 format, and therefore for 210 x 297 mm sheets
I have a very good example of the program you need written on Python. You can use this (sorry for bad tabulation):
import math
import math
def main():
function = input("Enter a function f(x):\n")
x = 0
y = 0
for rows in range(10,-11,-1):
for col in range(-10,11,1):
x=col
roundfx = round(eval(function))
if roundfx == rows:
print("o", end="")
if rows==0 and col==0 and not rows == roundfx:
print("+", end="")
if col == 0 and not rows == 0 and not rows == roundfx:
print("|", end="")
if rows==0 and not col==0 and not rows == roundfx:
print("-", end="")
else:
if not rows == 0:
if not col == 0:
if not rows == roundfx:
print(" ", end="")
print()
main()
Answer:
Explanation:
Algorithm:
a. In each day, you will have to loop through the hotels that come to the hotel after you stayed last night.
b. If a hotel 'h' is found at more than 'd' distance away from last stayed hotel, then the hotel previous of 'h' is chosen to wait for that night. This is the greedy step, and you stay in this hotel.
c. The process for steps a and b is then repeated until we've reached the last hotel xn.
Running time:
Notice that the worst case occurs if each hotel is at a distance of successive multiples of 'd'. The best move is to estimate the distance to each hotel twice the whole computation in the scenario.
Thus, the total running time that could occur in the worst case is O(2n) = O(n). This is said to be linear time.
The answer is D because a toutourial can explain each and everey process
