torda385/torsaseuclid: Euclidian GCD Algorithm

This package will use a Euclidian Algorithm to find the Greatest Common Denominator of two numbers. It is a test package for a course in Advanced R Programming at Linköping University, Sweden.

Getting started

Package details

AuthorTorrin Danner [aut],
MaintainerTorrin Danner <>
LicenseGPL (>=2)
Package repositoryView on GitHub
Installation Install the latest version of this package by entering the following in R:
torda385/torsaseuclid documentation built on May 31, 2019, 6:37 p.m.