How to fool the "try some test cases" heuristic: Algorithms that appear correct, but are actually incorrect
Proof of correctness of algorithm to determine whether the elements of an array are repeated an equal number of times
Why proving programs correctness doesn't have the same importance as algorithms analysis or the theory of computation in practice?
Existence / non-existence of a sequence with short longest increasing subsequence and decreasing subsequence?
Only top scored, non community-wiki answers of a minimum length are eligible