Computer Sciences > GATE 2015 SET-1 > Analysis of Algorithms
Consider the following C function.
Which one of the following most closely approximates the return value of the function fun1?
Correct : d
Similar Questions
Consider the following recurrence relation.T(n) = T(n/2) + T(2n/5) + 7n if n > 0T(n) = 1 if n = 0Which one of the following options is correct?
The minimum number of comparisons required to find the minimum and the maximum of 100 numbers is _______.
Consider the following pseudocode. What is the total number of multiplications to be performed?
D = 2
for i = 1 to n do
for j = i to n...
Total Unique Visitors
Loading......