Abstract
Algorithms and associated FORTRAN subroutines for the Fisher exact probability test are presented. R by C cross-classification tables up to five degrees of freedom are considered. These include the 2 ร 2, 3 ร 2, 4 ร 2, 3 ร 3, 5 ร 2, and 6 ร 2 tables. The use of recursion and an arbitrary initial value ensures computational efficiency.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.