blob: 3d5862327a7159bc34693709e66d7a2ffce85402 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
|
/* 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;
for(int i=max;i>=1;i--)
{
if(x%i==0 && y%i==0)
{
temp=i;
break;
}
}
for(int j=2;j<size;j++)
{
x=temp;
y=*(in+j);
max=(x>y)?x:y;
for(int i=max;i>=1;i--)
{
if(x%i==0 && y%i==0)
{
temp=i;
break;
}
}
}
}
return temp;
}
|
