Users Also Read
MCQ's Search Engine
Electrical Engineering
Mechanical Engineering
Civil Engineering
Automobile Engineering
Chemical Engineering
Computer Engineering
Electronics Engineering
Medical Science Engg
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 [Wrong Answer] |
B. | log n [Correct Answer] |
C. | n+1 [Wrong Answer] |
D. | n-1 [Wrong Answer] |