6.24 Common Bugs
Identify boundary errors, broken invariants, and comparator mistakes that cause sorting implementations to fail on edge cases or duplicate-heavy inputs.
Tag
Correctness
6 notes
6.23 Testing Sort Correctness
Verify both the ordering and permutation properties of sorting implementations using randomized, edge-case, and adversarial test strategies.
6.17 Custom Comparators
Define correct comparison relations for user-defined types and non-trivial orderings — consistency requirements that sorting correctness depends on.
6.1 Sorting Contracts
A sorting algorithm is correct only when its output is both ordered and a permutation of the input — two properties every implementation must preserve.
5.20 Testing Hash Logic
Verify correctness, stability, and performance of hash-based structures through randomized and adversarial test strategies.
1.4 Loop Invariants
Loop invariants are the primary tool for reasoning about iterative algorithms.