L. Csirmaz:
A simple algorithm with no simple verification
The correctness of a simple sorting algorithm is presented, which algorithm
is "evidently wrong" at the first sight. It is conjectured that
the algorithm has no straightforward, transparent verification. The paper
is a nice example for the usage of the Floyd-Hoare-Naur verification
method.