Abstract
An algorithm, in t h e form of a Fortran subroutine TRIPLE,is given to compute statistics forthetriples test for symmetry, The 2 computational complexity of the algorithm is O(n2 ) which is an 3 improvement over the straightforward method, which is O(n3).