DSA · Theory

Time Complexity of Sorting Algorithms

← All stacks

Theory

58/810

Time Complexity of Sorting Algorithms

Don’t start Time Complexity of Sorting Algorithms with jargon. Start with names A→Z. That is the whole point.

Keep Time Complexity of Sorting Algorithms small. Vikram should finish names A→Z in a few lines, not a 40-line dump.

Time Complexity of Sorting Algorithms exists so Vikram can keep names A→Z correct in the roll list.

Time Complexity of Sorting Algorithms shows up in the roll list. Name names A→Z, not “a real-world scenario”.

Time Complexity of Sorting Algorithms trap: unstable sort when equal keys matter. Vikram loses marks for that every viva.

After Time Complexity of Sorting Algorithms, Vikram should still remember unstable sort when equal keys matter.

Viva for Time Complexity of Sorting Algorithms: what it is → n log n vs n² → the mistake (unstable sort when equal keys matter).

Exam tip

Say Time Complexity of Sorting Algorithms in one breath, then n log n vs n², then unstable sort when equal keys matter.

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))

Time Complexity of Sorting Algorithms — big-O describes how work grows with input size — ignore constants.

Short notes

DefTime Complexity of Sorting Algorithms — Vikram uses it for names A→Z in the roll list.
RuleTime Complexity of Sorting Algorithms → n log n vs n².
RememberTime Complexity of Sorting Algorithms + Big-O (the roll list).
UseTime Complexity of Sorting Algorithms in the roll list (names A→Z).
TrapTime Complexity of Sorting Algorithms — unstable sort when equal keys matter.
ExTime Complexity of Sorting Algorithms → names A→Z.

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))

Time Complexity of Sorting Algorithms

Example

Short notes

Questions

Time Complexity of Sorting Algorithms

Example

Short notes

Questions