##########################################################################
## 1.1.1 euclidean()
### My new package way
#' algorithm to find the greatest common divisor of two numbers.
#'
#' Takes two numeric integer numbers and find its maximum commom divisor
#' @param first_number A numeric value to be divided by all it numbers smaller or equal than them, arranged in a vector
#' @param second_number A numeric value to be divided by the vector created
#' @return maximum commom divisor betwen first_number and second_ number
#' @references https://en.wikipedia.org/wiki/Euclidean_algorithm
#'
#' @export
euclidian <- function(first_number,second_number){
if(length(first_number)==1 & is.numeric(first_number) & length(second_number)==1 & is.numeric(second_number))
{
### Creating list of prime numbers
number_to_divide<-min(first_number,second_number)
### Creating first array with first number
while(first_number!= second_number) {
if (first_number > second_number) {
first_number <- first_number - second_number
}
else{
second_number<- second_number - first_number
}
}
return(first_number)
}
else{
stop("Error:length of the arguments are not equal to 1 and/or arguments are not numeric")
}
}
euclidian(123612, 13892347912)
euclidian(100, 1000)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.