Q. 4 The running time of an algorithm is represented by the following recurrence relation:
Which one of the following represents the time complexity of the algorithm ?
Answer: (A)
Explanation:
Q. 4 The running time of an algorithm is represented by the following recurrence relation:
Which one of the following represents the time complexity of the algorithm ?
Answer: (A)
Explanation:
