Which of the following generally grows fastest as N becomes very large?

Options

  • A. O(log N)
  • B. O(N)
  • C. O(N2)
  • D. More than one of the above
  • E. None of the above

Correct Answer (Detailed Explanation is Below)

C. O(N2)

Detailed Explanation

Among the given complexities, O(N2) grows faster as N becomes very large than O(N) and O(log N). The general growth order is O(1) < O(log N) < O(N) < O(N log N) < O(N2), followed by faster-growing functions such as O(2N) and O(N!). This comparison helps estimate how algorithms behave as input size increases.

← Previous Next →

Attempt Quiz Now:

BPSC TRE 4 DSA Practice set 1

Feature Posts