Question

Could you please help me to solve the problem. Also, could you please answer questions in clear hand-writing and show me the full process, thank you (Sometimes I get the answer which was difficult to read).Thanks a lot

What is the smallest positive value of n, where n is an integer, such that Algorithm A, whose running time is 100n²  runs faster than Algorithm B, whose running time is 2ⁿ , on the same machine (give your answer in whole number(s))

Answer 1

`Hey,

Note: Brother if you have any queries related the answer please do comment. I would be very happy to resolve all your queries.

Since algorithm A takes 100*n^2 and B takes 2^n

So,

100*n^2<2^n for Algorithm A to be faster since time taken should be less

So,

root of 100*n^2-2^n=0 is 14.3

So,

n>=15

So, smallest positive integer n is 15

Kindly revert for any queries

Thanks.