Computer Science · Asymptotic Analysis
Which of the following provides the correct increasing order of asymptotic growth complexity for the given functions? f1(n) = 2n, f2(n) = n3/2, f3(n) = n log n, f4(n) = nlog n
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1f2, f3, f4, f1
- 2f2, f3, f1, f4
- 3f3, f2, f1, f4
- 4f3, f2, f4, f1✓
Correct answer
f3, f2, f4, f1
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Asymptotic Analysis MCQs →Want more practice questions on Asymptotic Analysis?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Asymptotic Analysis