DSA · Theory

What is Logarithmic Time Complexity

Theory

798/810

What is Logarithmic Time Complexity

Logarithmic Time Complexity (what is) is simple if you keep it on paper. Zara uses it for n vs n² on 10k rows in a viva.

For Logarithmic Time Complexity (what is), time vs memory is in play. Don’t blame it until you have traced n vs n² on 10k rows.

Skip Logarithmic Time Complexity (what is) and saying ‘fast’ with no Big-O shows up in a viva.

Use Logarithmic Time Complexity (what is) when n vs n² on 10k rows must stay clear. If a simpler DSA step works, use that instead.

Don’t do this with Logarithmic Time Complexity (what is): saying ‘fast’ with no Big-O. Interviewers spot it in ten seconds.

After Logarithmic Time Complexity (what is), Zara should still remember saying ‘fast’ with no Big-O.

One breath for Logarithmic Time Complexity (what is), then n vs n² on 10k rows, then saying ‘fast’ with no Big-O. Sit down.

Exam tip

Board: n vs n² on 10k rows. Dry-run Logarithmic Time Complexity (what is). Name the trap: 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))

What is Logarithmic Time Complexity — big-O describes how work grows with input size — ignore constants.

Short notes

DefLogarithmic Time Complexity (what is) — Zara uses it for n vs n² on 10k rows in a viva.
RuleLogarithmic Time Complexity (what is) → best / average / worst + extra memory.
RememberLogarithmic Time Complexity (what is) + time vs memory (a viva).
UseLogarithmic Time Complexity (what is) in a viva (n vs n² on 10k rows).
TrapLogarithmic Time Complexity (what is) — saying ‘fast’ with no Big-O.
ExLogarithmic Time Complexity (what is) → 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))

What is Logarithmic Time Complexity

Example

Short notes

Questions

What is Logarithmic Time Complexity

Example

Short notes

Questions