DSA · Theory

Internal Data Structures and Time Complexity Table of All the C++ STL Containers

Theory

685/810

Internal Data Structures and Time Complexity Table of All the C++ STL Containers

Don’t start Internal Data Structures and Time Complexity Table of All the C++ STL Containers with jargon. Start with n vs n² on 10k rows. That is the whole point.

Do Internal Data Structures and Time Complexity Table of All the C++ STL Containers once by hand. best / average / worst + extra memory. Change one input. Say the new result out loud.

Skip Internal Data Structures and Time Complexity Table of All the C++ STL Containers and saying ‘fast’ with no Big-O shows up in a viva.

Vikram ships Internal Data Structures and Time Complexity Table of All the C++ STL Containers in a viva. That is the use case worth saying.

Internal Data Structures and Time Complexity Table of All the C++ STL Containers trap: saying ‘fast’ with no Big-O. Vikram loses marks for that every viva.

Place Internal Data Structures and Time Complexity Table of All the C++ STL Containers next to nearby DSA work — best / average / worst + extra memory is the link.

Close Internal Data Structures and Time Complexity Table of All the C++ STL Containers with: “If I skip it, n vs n² on 10k rows goes wrong like this: saying ‘fast’ with no Big-O.”

Exam tip

Say Internal Data Structures and Time Complexity Table of All the C++ STL Containers 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))

Internal Data Structures and Time Complexity Table of All the C++ STL Containers — big-O describes how work grows with input size — ignore constants.

Short notes

DefInternal Data Structures and Time Complexity Table of All the C++ STL Containers — Vikram uses it for n vs n² on 10k rows in a viva.
RuleInternal Data Structures and Time Complexity Table of All the C++ STL Containers → best / average / worst + extra memory.
RememberInternal Data Structures and Time Complexity Table of All the C++ STL Containers + Big-O (a viva).
UseInternal Data Structures and Time Complexity Table of All the C++ STL Containers in a viva (n vs n² on 10k rows).
TrapInternal Data Structures and Time Complexity Table of All the C++ STL Containers — saying ‘fast’ with no Big-O.
ExInternal Data Structures and Time Complexity Table of All the C++ STL Containers → 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))

Internal Data Structures and Time Complexity Table of All the C++ STL Containers

Example

Short notes

Questions

Internal Data Structures and Time Complexity Table of All the C++ STL Containers

Example

Short notes

Questions