Answers are grounded in this paper and cite their sources.
A practical computer program is described for Fisher's randomization one-sample and two-sample tests of location. Two heuristics permit most of the permutations to be counted implicitly rather than explicitly. The heuristics, together with careful program organization, yield a very efficient program.
No takes yet. Share an insight, caveat, or question.
Bert F. Green (1977) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: