Updated Scilab2C

10 files changed, 391 insertions, 0 deletions

diff --git a/src/c/elementaryFunctions/discrete_mathematics/factor/dfactors.c b/src/c/elementaryFunctions/discrete_mathematics/factor/dfactors.c
new file mode 100644
index 0000000..9ac76b5
--- /dev/null
+++ b/src/c/elementaryFunctions/discrete_mathematics/factor/dfactors.c
@@ -0,0 +1,39 @@
+/* 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
+ Organization: FOSSEE, IIT Bombay
+ Author: Shamik Guha
+ Email: toolbox@scilab.in
+*/
+# include <stdio.h>
+# include <math.h>
+ 
+void dfactors(double in,double* out)
+{
+    int i=0,k=0;
+    int n=(int)in;
+    while (n%2 == 0)
+    {
+        out[k++]=2;
+        n = n/2;
+    }
+ 
+    for (i = 3; i <= (int)sqrt((double)n); i = i+2)
+    {
+        while (n%i == 0)
+        {
+	        out[k++]=i;
+            n = n/i;
+        }
+    }
+ 
+        if (n > 2)
+	{
+		out[k++]=n;
+	}
+}
+ 
diff --git a/src/c/elementaryFunctions/discrete_mathematics/factor/sfactors.c b/src/c/elementaryFunctions/discrete_mathematics/factor/sfactors.c
new file mode 100644
index 0000000..a2eed09
--- /dev/null
+++ b/src/c/elementaryFunctions/discrete_mathematics/factor/sfactors.c
@@ -0,0 +1,39 @@
+/* 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
+ Organization: FOSSEE, IIT Bombay
+ Author: Shamik Guha
+ Email: toolbox@scilab.in
+*/
+# include <stdio.h>
+# include <math.h>
+ 
+void sfactors(float in,float* out)
+{
+    int i=0,k=0;
+    int n=(int)in;
+    while (n%2 == 0)
+    {
+    	out[k++]=2;
+        n = n/2;
+    }
+ 
+    for (i = 3; i <= (int)sqrt((double)n); i = i+2)
+    {
+        while (n%i == 0)
+        {
+	        out[k++]=i;
+            n = n/i;
+        }
+    }
+ 
+    if (n > 2)
+	{
+		out[k++]=n;
+    }
+}
+ 
diff --git a/src/c/elementaryFunctions/discrete_mathematics/factorial/dfactoriala.c b/src/c/elementaryFunctions/discrete_mathematics/factorial/dfactoriala.c
new file mode 100644
index 0000000..68a118b
--- /dev/null
+++ b/src/c/elementaryFunctions/discrete_mathematics/factorial/dfactoriala.c
@@ -0,0 +1,23 @@
+/* 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
+ Organization: FOSSEE, IIT Bombay
+ Author: Shamik Guha
+ Email: toolbox@scilab.in
+*/
+#include "factorial.h"
+#include <math.h>
+
+void dfactoriala(double* in,int size,double* out)
+{
+   	int i=0;
+  	for (i=0;i<size;i++)
+	{
+		out[i] = dfactorials(in[i]);
+	}
+}
+
diff --git a/src/c/elementaryFunctions/discrete_mathematics/factorial/dfactorials.c b/src/c/elementaryFunctions/discrete_mathematics/factorial/dfactorials.c
new file mode 100644
index 0000000..354eb6a
--- /dev/null
+++ b/src/c/elementaryFunctions/discrete_mathematics/factorial/dfactorials.c
@@ -0,0 +1,35 @@
+/* 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
+ Organization: FOSSEE, IIT Bombay
+ Author: Shamik Guha
+ Email: toolbox@scilab.in
+*/
+#include <stdio.h>
+#include <math.h>
+#include "factorial.h"
+
+double dfactorials(double in)
+{
+	int i,n;
+	long long int fact=1;
+	n=(int)in;
+        if (n < 0)
+        printf("Error! Factorial of a negative number doesn't exist.");
+	else if (n>170)
+		printf("Inf");
+        else
+        {
+           for(i=1; i<=n; i++)
+           {
+              fact=fact*i;
+	      //printf("\n %lld",fact);
+           }
+        }
+
+    return fact;
+}
diff --git a/src/c/elementaryFunctions/discrete_mathematics/factorial/sfactoriala.c b/src/c/elementaryFunctions/discrete_mathematics/factorial/sfactoriala.c
new file mode 100644
index 0000000..14f46d8
--- /dev/null
+++ b/src/c/elementaryFunctions/discrete_mathematics/factorial/sfactoriala.c
@@ -0,0 +1,23 @@
+/* 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
+ Organization: FOSSEE, IIT Bombay
+ Author: Shamik Guha
+ Email: toolbox@scilab.in
+*/
+#include "factorial.h"
+#include <math.h>
+
+void sfactoriala(float* in,int size,float* out)
+{
+   	int i=0;
+  	for (i=0;i<size;i++)
+	{
+		out[i] = dfactorials(in[i]);
+	}
+}
+
diff --git a/src/c/elementaryFunctions/discrete_mathematics/factorial/sfactorials.c b/src/c/elementaryFunctions/discrete_mathematics/factorial/sfactorials.c
new file mode 100644
index 0000000..e4f1017
--- /dev/null
+++ b/src/c/elementaryFunctions/discrete_mathematics/factorial/sfactorials.c
@@ -0,0 +1,34 @@
+/* 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
+ Organization: FOSSEE, IIT Bombay
+ Author: Shamik Guha
+ Email: toolbox@scilab.in
+*/
+#include <stdio.h>
+#include <math.h>
+#include "factorial.h"
+
+float sfactorials(float in)
+{
+	int i,n;
+	long long int fact=1;
+	n=(int)in;
+    if (n < 0)
+        printf("Error! Factorial of a negative number doesn't exist.");
+	else if(n>170)
+		printf("Inf");
+    else
+    {
+        for(i=1; i<=n; i++)
+        {
+            fact *= i;
+        }
+    }
+
+    return fact;
+}
diff --git a/src/c/elementaryFunctions/discrete_mathematics/gcd/u8gcda.c b/src/c/elementaryFunctions/discrete_mathematics/gcd/u8gcda.c
new file mode 100644
index 0000000..3d58623
--- /dev/null
+++ b/src/c/elementaryFunctions/discrete_mathematics/gcd/u8gcda.c
@@ -0,0 +1,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;
+}
+
diff --git a/src/c/elementaryFunctions/discrete_mathematics/lcm/u8lcma.c b/src/c/elementaryFunctions/discrete_mathematics/lcm/u8lcma.c
new file mode 100644
index 0000000..56856e4
--- /dev/null
+++ b/src/c/elementaryFunctions/discrete_mathematics/lcm/u8lcma.c
@@ -0,0 +1,68 @@
+/* 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 "lcm" function, accepting two inputs which are the array of integers
+    and second the size of the array. The algorithm works like this:
+    We take a temproary variable and store the lcm of the first two elements of the
+    array in it. Now using this temproary variable we recursively fin the lcm of
+    the whole array.
+    Now to fin the lcm of two elements we fin the maximum of the two elements and
+    check whether it is divisible by both the elements, if the condition is true we
+    get the lcm, else increase the maximum value by itself unless we get the lcm.
+*/
+#include "lcm.h"
+uint8 u8lcma(uint8* in,int size)
+{
+    long long int lcm_temp;
+    if(size==1)
+    {
+    lcm_temp=*in;
+    }
+    else
+    {
+    
+    int x1=*in;
+    int x2=*(in+1);
+    long long int max=(x1>x2)?x1:x2;
+    long long int i=max;
+    while(1)
+    {
+        if(i%x1==0 && i%x2==0)
+        {
+        lcm_temp=i;
+        break;
+        }
+        else
+        i+=max;
+    }
+    for(int j=2;j<size;j++)
+    {
+    x1=lcm_temp;
+    x2=*(in+j);
+    max=(x1>x2)?x1:x2;
+    i=max;
+    while(1)
+    {
+        if(i%x1==0 && i%x2==0)
+        {
+        lcm_temp=i;
+        break;
+        }
+        else
+        i+=max;
+    }
+    }
+    
+    }
+  return lcm_temp;
+}
+
diff --git a/src/c/elementaryFunctions/discrete_mathematics/primes/dprimess.c b/src/c/elementaryFunctions/discrete_mathematics/primes/dprimess.c
new file mode 100644
index 0000000..3aa0af4
--- /dev/null
+++ b/src/c/elementaryFunctions/discrete_mathematics/primes/dprimess.c
@@ -0,0 +1,35 @@
+/* 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
+ Organization: FOSSEE, IIT Bombay
+ Author: Shamik Guha
+ Email: toolbox@scilab.in
+*/
+#include<stdio.h>
+#include "primes.h"
+void dprimess(double in, double* out)
+{
+     int i=0,j=0,k=0,n=0,counter=0;
+     n=(int)in;
+     for(i=2;i<=n;i++)
+     {
+             counter=0;
+             for(j=2;j<i;j++)
+             {
+                     if(i%j==0)
+                     {
+                               counter=1;
+                               break;
+                     }
+             }
+            if(counter==0)
+             {
+                 out[k++]=i;
+		 
+             }
+     }
+}
diff --git a/src/c/elementaryFunctions/discrete_mathematics/primes/sprimess.c b/src/c/elementaryFunctions/discrete_mathematics/primes/sprimess.c
new file mode 100644
index 0000000..bff39d7
--- /dev/null
+++ b/src/c/elementaryFunctions/discrete_mathematics/primes/sprimess.c
@@ -0,0 +1,35 @@
+/* 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
+ Organization: FOSSEE, IIT Bombay
+ Author: Shamik Guha
+ Email: toolbox@scilab.in
+*/
+#include<stdio.h>
+#include "primes.h"
+void sprimess(float in, float* out)
+{
+     int i=0,j=0,k=0,n=0,counter=0;
+     n=(int)in;
+     for(i=2;i<=n;i++)
+     {
+             counter=0;
+             for(j=2;j<i;j++)
+             {
+                     if(i%j==0)
+                     {
+                               counter=1;
+                               break;
+                     }
+             }
+             if(counter==0)
+             {
+                 out[k]=i;
+		 k++;
+             }
+     }
+}