(Fill in the blanks) Total number of computations in algorithm A is 2n + 2 and total number of computations in algorithm B is 2log(n) + 2, where ‘n’ is input size. The following is the process to analyze which algorithm is more efficient when the input size n is very big.
Time Complexity of algorithm A = O( )
Time Complexity of algorithm B = O( )
Therefore, algorithm ( ) is more efficient.
Answers
Answered by
0
Answer:
Step-by-step explanation:
Similar questions