Computers and Technology
Computers and Technology, 29.08.2019 20:10, cobalt426

Suppose that the number for floating point operations (flops) for the following functions (i. e., algorithms) have been estimated as:
(a) f(n) : 2n + 3n flops
(b) g(n): n! +2n logn +n2 flops
(c) h(n): (6+3n +n2)(n log n) flops
write down the time complexity of each function in o-notation.

answer
Answers: 2

Similar questions

Do you know the correct answer?
Suppose that the number for floating point operations (flops) for the following functions (i. e., al...

Questions in other subjects: