Logarithms

October 23, 2024

Logarithms

October 23, 2024

Asymptotic-Complexity

Question 32

Which of the following functions asymptotically grows the fastest as n goes to inﬁnity?

A	(log log n)!
B	(log log n)^{log n}
C	(log log n)^{log log log n}
D	(log n)^{log log n}
E	2^{√(log log n)}

AlgorithmsAsymptotic-ComplexityTIFR PHD CS & SS 2017

Correct Answer: B

Utkarsh S

0 0 votes

Article Rating

Subscribe

0 Comments

Inline Feedbacks

View all comments

0

Would love your thoughts, please comment.x

()

error: Alert: Content selection is disabled!!