Treesort 3 (Algorithm 245 $M1))

The certification of an algorithm can take
the form of a proof that the algorithm is correct.  As an illustrative
but practical example, Algorithm 245, TREESORT 3 for sorting
an array, is proved correct.

CACM June, 1970

London, R. L.

proof of algorithms, debugging, certification,
metatheory, sorting, in-place sorting

4.42 4.49 5.24 5.31

CA700613 JB February 13, 1978  10:32 AM

2042	4	2042
2042	4	2042
2222	4	2042
2356	4	2042
2679	4	2042
2679	4	2042
2844	4	2042
2972	4	2042
970	5	2042
1228	5	2042
2042	5	2042
2042	5	2042
2042	5	2042
2222	5	2042
2679	5	2042
970	6	2042
970	6	2042
1175	6	2042
1190	6	2042
1228	6	2042
1800	6	2042
1818	6	2042
1834	6	2042
1969	6	2042
1997	6	2042
308	6	2042
2042	6	2042
2042	6	2042
3187	6	2042
507	6	2042
716	6	2042
783	6	2042