Search⌘ K
AI Features
Home
Courses
Data Structures for Coding Interviews in Python

Solution: Big O of Nested Loop with Subtraction

Explore the step-by-step process to evaluate the Big O time complexity of nested loops that involve subtracting multiples from the loop variable. Understand how the loop runs and how it leads to a quadratic time complexity O(n squared). This lesson helps you sharpen your skills in algorithm complexity analysis with practical examples.

We'll cover the following...

Solution #

Python 3.5
n = 10  # n can be anything, this is just an example
sum = 0
pie = 3.14
for var in range(n, 1, -3):
    print(pie)
    for j in range(n, 0, -1):
        sum += 1
print(sum)

The variable var gets set to nn then n−3n-3 ...