Q#1: Suppose that you have two different algorithms for solving a problem. To solve a problem of size n, the first algorithm use

Question

3 years ago

15

Q#1: Suppose that you have two different algorithms for solving a problem. To solve a problem of size n, the first algorithm use

s exactly n*exp1-[n+2n+3n+4n]/nlne(10) operations and the second algorithm uses exactly n! operations. As n grows, which algorithm uses fewer operations?

Mathematics

1 answer:

svetlana [45] · Answer 1 · 2022-07-11T22:56:56+03:00

svetlana [45]3 years ago

7 0

Answer:

The one of -[n+2n+3n+4n]/nlne(10) has fewer operations because the value of n is <u>static</u><u>.</u>

The one of n! ( factorial ) is factorised up to n∞ hence has infinity operations.