Answer:
For values when n<32 use fb(n) else use fa(n).
See explaination for details
Explanation:
Earlier when n=1 fa(n)=2000 while fb(n)=2. for n=2 fa(n)=2000*22 =2000*4=8000 while fb(n)=2*24=2*16=32. It is observed that fa(n) requires more time than fb(n) for small values.
Now, we will see when fb(n) crosses fa(n). This can happen only when fb(n) values equals or greater than fa(n)
therefore,
2000n2<=2n4
Solving equation we get n2>=1000 which can happen when n>=32.
So for values when n<32 use fb(n) else use fa(n)
Answer:
I've implemented this program using python
userinput = int(input("Length: "))
mylist = []
mylist.append(userinput)
for i in range(1,userinput+1):
userinp = int(input("Input: "))
mylist.append(userinp)
smallval = mylist[1]
for i in range(1,len(mylist)):
if smallval > mylist[i]:
smallval = mylist[i]
for i in range(1,len(mylist)):
mylist[i] = mylist[i] - smallval
for i in range(1,len(mylist)):
print(mylist[i],end=' ')
Explanation:
I've added the full source program as an attachment where I used comments to explain difficult lines
Answer:
Plastic container
Explanation:
because if we use iron it may rust and oil may also damage
Answer:
machine language uses binary code and assembly language uses mnemonic codes to write a program.
Explanation:
In a nutshell, machine language uses binary code, which is almost impossible for humans to decipher, whereas assembly language uses mnemonic codes to write a program. Mnemonic codes make it simpler for humans to understand or remember something, and so make the language a bit easier for humans to use than machine code.
