Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by abhees
1
answer
1
GATE-1999
Consider the following algorithms. Assume, procedure $A$ and procedure $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 then call A else begin what (n-1); call B(n ... $c$ So complexity should be $O(1)$. But answer is $O(n)$.What I am doing wrong?
Consider the following algorithms. Assume, procedure $A$ and procedure $B$ take $O(1)$ and $O(1/n)$ unit of time respectively. Derive the time complexity of the algorithm...
772
views
answered
Feb 26, 2020
Algorithms
algorithms
time-complexity
recurrence-relation
+
–
4
answers
2
TIFR CSE 2020 | Part B | Question: 10
Among the following asymptotic expressions, which of these functions grows the slowest (as a function of $n$) asymptotically? $2^{\log n}$ $n^{10}$ $(\sqrt{\log n})^{\log ^{2} n}$ $(\log n)^{\sqrt{\log n}}$ $2^{2^{\sqrt{\log\log n}}}$
Among the following asymptotic expressions, which of these functions grows the slowest (as a function of $n$) asymptotically?$2^{\log n}$$n^{10}$$(\sqrt{\log n})^{\log ^{...
4.7k
views
answered
Feb 26, 2020
Algorithms
tifr2020
algorithms
asymptotic-notation
time-complexity
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register