An algorithm is made up of two independent time complexities f (n) and g (n). Then the complexities of the algorithm is in the order of

Question:
An algorithm is made up of two independent time complexities f (n) and g (n). Then the complexities of the algorithm is in the order of

1. f(n) x g(n)

2. max ( f(n),g(n))

3.min (f(n),g(n))

4. f(n) + g(n)

Posted Date:-2022-07-06 07:03:25


More MCQS Questions and answers

Search
R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!