How would you decide between $F_2$ and $F_3$?

The Gateway to Computer Science Excellence

+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?

$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?

+1

Ayush your order is spot on.

@srestha F4 comes first, followed by F2, not the other way around. Comment below in case you need explanation.

@srestha F4 comes first, followed by F2, not the other way around. Comment below in case you need explanation.

+1

@goxul-Check this for better understanding

https://math.stackexchange.com/questions/111918/growth-of-exponential-functions-vs-polynomial

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.4k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,737 questions

57,291 answers

198,208 comments

104,888 users