Skip to content

Create highest_common_factor.m #22

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
cozek merged 1 commit into from
Feb 10, 2020
Merged

Create highest_common_factor.m #22

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
16 changes: 16 additions & 0 deletions algorithms/maths/highest_common_factor.m
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,16 @@
ffunction HCF = mini (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 = mini(y-x,x);
else
HCF = mini(x-y,y);
end