What is the time complexity of this triangle pattern?
It is O(N^2). Even though the inner loop runs fewer times initially, mathematically it executes roughly (N^2)/2 times, which simplifies to O(N^2).
Verify This Answer
Cross-check this information using these trusted sources:
More FAQs in How to Print a Right-Angled Triangle Pattern
The key is making the inner loop's termination condition dynamically dependent on the outer loop's counter (e.g., col <= row).
The inner loop will lose its dynamic dependency and will always print N stars, resulting in a square instead of a triangle.
Yes, simply replace the print statement. If you print 'col', it will output '1', '12', '123'. If you print 'row', it will output '1', '22', '333'.
Still have questions?
Browse all our FAQs or reach out to our support team