1 votes 1 votes An algorithm is made up of two modules $M1$ and $M2.$ If order of $M1$ is $f(n)$ and $M2$ is $g(n)$ then he order of algorithm is $max(f(n),g(n))$ $min(f(n),g(n))$ $f(n) + g(n)$ $f(n) \times g(n)$ Algorithms nielit2017oct-assistanta-cs algorithms time-complexity + – admin asked Apr 1, 2020 edited Aug 29, 2020 by soujanyareddy13 admin 987 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes ANS A https://gateoverflow.in/231142/%23asymptotic-notations Mohit Kumar 6 answered May 2, 2020 Mohit Kumar 6 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes option A) max(f(n),g(n)) is the answer. Sanandan answered Sep 11, 2020 Sanandan comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes A – SHOULD BE THE ANSWER. Ajay_777 answered Oct 24, 2020 Ajay_777 comment Share Follow See all 0 reply Please log in or register to add a comment.