The answer
It is Quadratic Time. It means the execution time of an algorithm grows proportionally to the square of the input size.
Understanding the Time Complexity of O(n^2)
What is O(N^2) time complexity?
More FAQs in Understanding the Time Complexity of O(n^2)
No. If the inner loop bounds are constant (e.g., it always runs 10 times regardless of N), the overall complexity remains O(N).
Because the number of operations explodes exponentially. For an input of 100,000, an O(N^2) algorithm requires 10 billion operations, which takes too long for standard CPUs.
You can often reduce O(N^2) to O(N) by utilizing Hash Maps to look up data instantly, or to O(N log N) by sorting the data first.
Still have questions?
Browse all our FAQs or reach out to our support team
Want to upskill yourself?
Your learning library
Small steps. Big possibilities.
Find your next course. Build something great.