Register

GATEBOOK_DS_1_12_Asymptotic_Notations

1,296 views
4 4 votes
Which of the following is the correct order if they are ordered by asymptotic growth rates?

$F_1:n^{lg\,lgn}$

$F_2:(3/2)^n$

$F_3:(lg\,n)^{lg\, n}$

$F_4:n!$

$F_3$ can be re-written as $n^{lg\,lgn}$ using property $a^{log_bc}=c^{log_ba}$

So, $F_4 \gt F_2 \gt F_1=F_3$

Is my order correct?

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Control DependenciesNext → · ACE_DS_2019
← Previous in category · Breadth First Search...Next in category → · What is the value of...
Position:
Show:

Related questions

0 0 votes
1 1 answer
121
121 views
GO Classes asked Aug 25
121 views
GO Classes DPP | GATE CS, DA | Algorithms | Asymptotic Analysis
Let $T_A(n)$ and $T_B(n)$ denote the worst-case running times of two algorithms $A$ and $B$ that solve the same problem.We say that $A$ is asymptotically more efficient t...
0 0 votes
1 1 answer
136
136 views
GO Classes asked Aug 8
136 views
GO Classes DPP | GATE CS, DA | Algorithms | Asymptotic Analysis
Consider the following functions$f(n)=3n^{\sqrt{n}}$$g(n)=2^{\sqrt{n}\log_2 n}$$h(n)=n!$Which of the following is true?$h(n)$ is $O(f(n))$ $h(n)$ is $O(g(n))$ $g(n)\neq O...
15 15 votes
5 5 answers
2.8k
2.8k views
gatecse asked Feb 23
2,752 views
GATE CSE 2026 | Set 2 | Question: 14
Consider the following functions, where $n$ is a positive integer.\[n^{1 / 3}, \log (n), \log (n!), 2^{\log (n)}\]Which one of the following options lists the functions i...
0 0 votes
1 1 answer
372
372 views
Hatim asked Dec 3, 2025
372 views
Practice Question
· f1 = log(n!)· f2 = (log n)!. f3 = (log n)^log n. f4 = (log n)^log log n. f5 = (log log n)^log narrangement in increasing order?