Ask HN: How do you verify an algorithm’s correctness

The most intuitive way I know to disprove an algorithm is by finding a counter example. But for complex algorithms it can be hard to find a counter example.

Do you have any practical advice? Should I learn formal proofs?