ALL GATE QUESTIONS SUBJECTWISE



GATE 1993 Question - Marks 5

Consider the following algorithms.Assume,procedure A and B take O (1) and O (1/n) unit of time respectively.Derive the time complexity of the algorithm in O - notation.
algorithm what (n)
begin
if n = 1 thne call A
else begin
what (n-1)
call B(n)
end
end.

Total 1 question