R/euclidean.R

luid<- "samza595 and rabsh696"
name<- "saman zahid & rabnawaz jansher"

#' @title Euclidian Algorithm
#' @name  euclidean
#' @param int_number1 number
#' @param int_number2 number
#' @return Greatest Common Divisor of two Numbers by Euclidean Algorithm
#' @description Euclidean Algorithm to find the greatest common divior of 2 number
#' @references \url{https://en.wikipedia.org/wiki/Euclidean_algorithm}
#' @export

euclidean<- function(int_number1, int_number2){
  t<- 0
  if(!is.numeric(int_number1) || !is.numeric(int_number2) ||
      length(int_number1) != 1 || length(int_number2) != 1 )
    stop()
  repeat
  {
    if(int_number2 != 0)
    {
      t <- int_number2;
      int_number2 <- int_number1 %% int_number2;
      int_number1 <- t;
    }
    else
    {
      break
    }
  }
  num_result<- int_number1
  return(num_result);
}
rjkhan/RCourse-lab3 documentation built on May 31, 2019, 8:56 a.m.