2 files changed, 78 insertions, 0 deletions
diff --git a/2.3-1/src/c/elementaryFunctions/discrete_mathematics/factor/dfactors.c b/2.3-1/src/c/elementaryFunctions/discrete_mathematics/factor/dfactors.c
new file mode 100644
index 00000000..9ac76b5a
--- /dev/null
+++ b/2.3-1/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/2.3-1/src/c/elementaryFunctions/discrete_mathematics/factor/sfactors.c b/2.3-1/src/c/elementaryFunctions/discrete_mathematics/factor/sfactors.c
new file mode 100644
index 00000000..a2eed09f
--- /dev/null
+++ b/2.3-1/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;
+    }
+}
+