1. Home
  2. Algorithms

Filters

Found 1 Question

Set Default
Exams
Subjects
Topics

List of top Algorithms Questions on Asymptotic Notation - Comparing Growth Rates of Functions

Consider the following functions, where \(n\) is a positive integer.
\[ n^{1/3}, \quad \log(n), \quad \log(n!), \quad 2^{\log(n)} \]
Which one of the following options lists the functions in increasing order of asymptotic growth rate?
Note: Assume the base of log to be 2.
  • GATE CS - 2026
  • GATE CS
  • Algorithms
  • Asymptotic Notation - Comparing Growth Rates of Functions
contact us
terms & conditions
Privacy & Policy
© 2026 Patronum Web Private Limited