A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. The time complexity of an algorithm T(n), where n is the input size, is given by T( n) = T( n - 1) + 1/n if n > 1 The order of this algorithm is
a. n
b. log n
c. n+1
d. n-1
Answer:log n
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here