diff options
Diffstat (limited to '2.3-1/src/c/elementaryFunctions/discrete_mathematics/gcd')
3 files changed, 0 insertions, 126 deletions
diff --git a/2.3-1/src/c/elementaryFunctions/discrete_mathematics/gcd/dgcda.c b/2.3-1/src/c/elementaryFunctions/discrete_mathematics/gcd/dgcda.c deleted file mode 100644 index a32ed773..00000000 --- a/2.3-1/src/c/elementaryFunctions/discrete_mathematics/gcd/dgcda.c +++ /dev/null @@ -1,32 +0,0 @@ -/* Copyright (C) 2016 - IIT Bombay - FOSSEE - - This file must be used under the terms of the CeCILL. - This source file is licensed as described in the file COPYING, which - you should have received as part of this distribution. The terms - are also available at - http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt - Author: Ukasha Noor - Organization: FOSSEE, IIT Bombay - Email: toolbox@scilab.in -*/ - -#include "gcd.h" -#include "types.h" - -void dgcda(double *in,int size,double *out) -{ - double a=in[0]; - double b=in[1]; - while(a!=b && a!=0 && b!=0) - { - if(a>b) - { - a=a-b; - } - else - { - b=b-a; - } - } - out[0]=b; -} diff --git a/2.3-1/src/c/elementaryFunctions/discrete_mathematics/gcd/u8gcda.c b/2.3-1/src/c/elementaryFunctions/discrete_mathematics/gcd/u8gcda.c deleted file mode 100644 index 121d26ae..00000000 --- a/2.3-1/src/c/elementaryFunctions/discrete_mathematics/gcd/u8gcda.c +++ /dev/null @@ -1,62 +0,0 @@ -/* Copyright (C) 2017 - IIT Bombay - FOSSEE - - This file must be used under the terms of the CeCILL. - This source file is licensed as described in the file COPYING, which - you should have received as part of this distribution. The terms - are also available at - http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt - Author: Ankit Raj - Organization: FOSSEE, IIT Bombay - Email: toolbox@scilab.in -*/ -#include<stdio.h> -/* This is the "gcd" function , which takes two input. first - one is the array and the second one is the length of the array. - Now to calculate the gcd of two elements we fin the maximum of - the two elements, and then iterate from maximum value down to 1, - and check whether the particular value divides the two elements. - And in this way we can calculate the gcd of the whole array. -*/ -#include "gcd.h" -uint8 u8gcdua(uint8* in,int size) -{ - - int temp; - if(size==1) - { - temp=*in; - } - else - { - int x=*in; - int y=*(in+1); - int max=(x>y)?x:y; - int i; - for(i=max;i>=1;i--) - { - if(x%i==0 && y%i==0) - { - temp=i; - break; - } - } - int j; - for(j=2;j<size;j++) - { - x=temp; - y=*(in+j); - max=(x>y)?x:y; - for(i=max;i>=1;i--) - { - if(x%i==0 && y%i==0) - { - temp=i; - break; - } - } - } -} - - return temp; -} - diff --git a/2.3-1/src/c/elementaryFunctions/discrete_mathematics/gcd/u8gcds.c b/2.3-1/src/c/elementaryFunctions/discrete_mathematics/gcd/u8gcds.c deleted file mode 100644 index 75f831fc..00000000 --- a/2.3-1/src/c/elementaryFunctions/discrete_mathematics/gcd/u8gcds.c +++ /dev/null @@ -1,32 +0,0 @@ -/* Copyright (C) 2016 - IIT Bombay - FOSSEE - - This file must be used under the terms of the CeCILL. - This source file is licensed as described in the file COPYING, which - you should have received as part of this distribution. The terms - are also available at - http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt - Author: Ukasha Noor - Organization: FOSSEE, IIT Bombay - Email: toolbox@scilab.in -*/ - -#include "gcd.h" -#include "types.h" - -int8 u8gcds(int8 *in,int size) -{ - int a=in[0]; - int b=in[1]; - while(a!=b && a!=0 && b!=0) - { - if(a>b) - { - a=a-b; - } - else - { - b=b-a; - } - } - return b; -} |