Multiple choice technology

Choose the correct order of Big oh notation

  1. O(nlogn) <O(n) <O(logn) <O(1)

  2. O(nlogn) <O(logn) <O(n) <O(1)

  3. O(1) < O(logn)<O(n) <O(nlogn)

  4. O(n) <O(nlogn) <O(logn) <O(1)
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

This represents the standard hierarchy of algorithmic complexity: Constant time O(1) is fastest, followed by Logarithmic O(logn), Linear O(n), and Log-linear O(nlogn). The other options incorrectly order these growth rates.

Keep practicing — related questions