DSA · Theory

How to Analyze Time and Space Complexity

Theory

803/810

How to Analyze Time and Space Complexity

How to Analyze Time and Space Complexity is a DSA idea you prove with n vs n² on 10k rows, not with a slogan.

Keep How to Analyze Time and Space Complexity small. Vikram should finish n vs n² on 10k rows in a few lines, not a 40-line dump.

How to Analyze Time and Space Complexity exists so Vikram can keep n vs n² on 10k rows correct in a viva.

How to Analyze Time and Space Complexity shows up in a viva. Name n vs n² on 10k rows, not “a real-world scenario”.

How to Analyze Time and Space Complexity miss: saying ‘fast’ with no Big-O. Fix it before you talk about advanced DSA.

Place How to Analyze Time and Space Complexity next to nearby DSA work — best / average / worst + extra memory is the link.

Viva for How to Analyze Time and Space Complexity: what it is → best / average / worst + extra memory → the mistake (saying ‘fast’ with no Big-O).

Exam tip

Say How to Analyze Time and Space Complexity in one breath, then best / average / worst + extra memory, then saying ‘fast’ with no Big-O.

Example

def demo(n):
    # O(1)
    x = n + 1
    # O(n)
    total = sum(range(n))
    # O(n^2)
    pairs = 0
    for i in range(n):
        for j in range(n):
            pairs += 1
    return x, total, pairs

print(demo(3))

How to Analyze Time and Space Complexity — big-O describes how work grows with input size — ignore constants.

Short notes

DefHow to Analyze Time and Space Complexity — Vikram uses it for n vs n² on 10k rows in a viva.
RuleHow to Analyze Time and Space Complexity → best / average / worst + extra memory.
RememberHow to Analyze Time and Space Complexity + time vs memory (a viva).
UseHow to Analyze Time and Space Complexity in a viva (n vs n² on 10k rows).
TrapHow to Analyze Time and Space Complexity — saying ‘fast’ with no Big-O.
ExHow to Analyze Time and Space Complexity → n vs n² on 10k rows.

def demo(n): # O(1) x = n + 1 # O(n) total = sum(range(n)) # O(n^2) pairs = 0 for i in range(n): for j in range(n): pairs += 1 return x, total, pairs print(demo(3))

How to Analyze Time and Space Complexity

Example

Short notes

Questions

How to Analyze Time and Space Complexity

Example

Short notes

Questions