|
|||||
|
|
An improved algorithm for the triples test |
|
| Authors: | John F. Monahan |
| Affiliation: | Department of Statistics , North Carolina State University , Raleigh, North Carolina, 27650, USA |
| Abstract: | 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). |
| Keywords: | symmetry triples test computational complexity |