Highest Common Factor

𝔸𝕝𝕘𝕖𝕣

Highest Common Factor

function HCF = highest_common_factor (x, y)
%This function searches for highest common factor
%It first checks if any of the numbers equal to zero, if so the non zero number is the HCF
%If the numbers are different, you minus the bigger number by the smaller one and this is done by recursion. 
  if x==0
    HCF = y;
  elseif y==0
    HCF = x;
  elseif (y == x)
    HCF = x;
  elseif (y>x)
    HCF = highest_common_factor(y-x,x);
  else 
    HCF = highest_common_factor(x-y,y);
  end

Try this Code

About us

We are a group of programmers helping each other build new things, whether it be writing complex encryption programs, or simple ciphers. Our goal is to work together to document and model beautiful, helpful and interesting algorithms using code. We are an open-source community - anyone can contribute. We check each other's work, communicate and collaborate to solve problems. We strive to be welcoming, respectful, yet make sure that our code follows the latest programming guidelines.