Question

mention the rules of big-o notation​

Answer 1

Answer:

If an algorithm takes O(g(N) + f(N)) steps and the function f(N) is bigger than g(N), algorithm's performance can be simplified to O(f(N)). If an algorithm performs an operation that takes f(N) steps, and for every step performs another operation that takes g(N) steps, algorithm's total performance is O(f(N)×g(N)).