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
Browse package contents
Package details |
|
|---|---|
| Author | Torrin Danner [aut], |
| Maintainer | Torrin Danner <torda385@student.liu.se> |
| License | GPL (>=2) |
| Version | 1.0 |
| Package repository | View on GitHub |
| Installation |
Install the latest version of this package by entering the following in R:
|
