Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms

Consider the following Time Complexities:

  1. O(n)
  2. O(n2)
  3. O(n.logn)
  4. O(2n)
  5. O(n!)

Which of the following order of growth is correct? 

NOTE - Order of growth in ascending order

1
O(n) < O(\(n \log n\)) < O(n2) < O(n!) < O(2n) 
2
O(n) < O(\(n \log n\)) < O(n2) < O(2n) < O(n!)
3
O(\(n \log n \)) < O(n) < O(n2) < O(2n) < O(n!)
4
O(n) < O(\(n \log n\)) < O(2n) < O(n2) < O(n!)
Share: WhatsApp Telegram X

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters