For educational purposes, I am looking for an example of a complicated, elementary, but very well-explained combinatorial algorithm.

Such an example might be a bijection between two easily described sets, where the bijection involves many case distinctions.

Of course, "very well-explained" is completely subjective, but that is really the focus of the question.