An improved algorithm for the triples test
John F. Monahan · Communications in Statistics - Simulation and Computation · 1984
An algorithm, in the form of a Fortran subroutine TRIPLE, is given to compute statistics for the triples test for symmetry, The computational complexity of the algorithm is O(n2) which is an improvement over the straight for ward method, which is O(n3).