Answer:
Upper bound means the algorithm will not use more time than this.
Since there n sorted sequence and having n distinct keys, the upper bound will be :
O(n^2logn) using Min Heap, n^2 because there will be the output of array size n*n
Explanation:
Answer:
Explanation:
def computeCommission(salesAmount):
commission=0
if salesAmount <= 50000:
commission = 5000*0.08 + (salesAmount-5000)*0.1
elif salesAmount > 50000:
commission = 5000*0.09 + (salesAmount-5000)*0.12
return commission
print("commission for 45000 : "+str(computeCommission(45000)))
print("commission for 54000 : "+str(computeCommission(54000)))
Answer:p=float(input("Enter current bank balance:"))
i=float(input("Enter interest rate:"))
t=float(input("Enter the amount of time that passes:"))
print((p ((1+i)*t)))
Explanation:if this answer it looks weird its my phones fault
Answer:
The limitations of the first generation of computer are:-
•The operating speed was very low.
•Power consumption was very high.
•They required large space for installation.
<h2>Hope it helps you.</h2>
Answer:
(502763134343429265
/101)
Explanation:
