day 14 (CodeToExpress#148)

Author: Spreeha

Day1/Java/dailycodebase

@@ -0,0 +1 @@
+Subproject commit 251a720738c674bd4e8bf33fd82e917a7c6f5119

day13/Python/fact.py

@@ -0,0 +1,15 @@
+'''
+@author spreeha
+@date 07/01/19
+'''
+n=int(input())
+def factorial(n):
+    if n==0:
+        return 1
+    else:
+        return n*factorial(n-1)
+f=factorial(n)
+print(f)
+
+    
+    

day13/Python/fibo.py

@@ -0,0 +1,14 @@
+'''
+@author spreeha
+@date 07/01/98
+'''
+n=int(input())
+def fibonacci(n):
+    if n>=1 and n<=2:
+        return 1
+    else:
+        return fibonacci(n-1)+fibonacci(n-2)
+for i in range(1,n):
+    t=fibonacci(i)
+    print(t,end=", ")
+print(fibonacci(n))

day13/README.md

@@ -168,6 +168,22 @@ print("factorial of %d is %d" % (n, factorial(n)))
 
 ```
 
+#### [Solution ](./Python/fact.py)
+```python
+'''
+@author spreeha
+@date 07/01/19
+'''
+n=int(input())
+def factorial(n):
+    if n==0:
+        return 1
+    else:
+        return n*factorial(n-1)
+f=factorial(n)
+print(f)
+```
+
 #### [Solution by @aaditkamat](./Python/factorial_aadit.py)
 ```python
 """
@@ -474,6 +490,24 @@ else:
     print(", ".join(map(str, fib_series)))
 ```
 
+#### [Solution by @spreeha](./Python/fibo.py)
+```python
+'''
+@author spreeha
+@date 07/01/98
+'''
+n=int(input())
+def fibonacci(n):
+    if n>=1 and n<=2:
+        return 1
+    else:
+        return fibonacci(n-1)+fibonacci(n-2)
+for i in range(1,n):
+    t=fibonacci(i)
+    print(t,end=", ")
+print(fibonacci(n))
+```
+
 #### [Solution by @aaditkamat](./Python/fibonacci_aadit.py)
 ```python
 """

day14/Java/Recmultiply.java

@@ -0,0 +1,33 @@
+/*
+ * To change this license header, choose License Headers in Project Properties.
+ * To change this template file, choose Tools | Templates
+ * and open the template in the editor.
+ */
+package recursion;
+
+/**
+ * @date 08/01/19
+ * @author SPREEHA DUTTA
+ */
+import java.util.*;
+public class Recmultiply {
+   public static int product(int m,int n)
+   {
+       if (n==0)
+           return 0;
+       else
+           return m+product(m,n-1);
+   }
+    public static void main(String []args)
+    {
+        int m,n,p;
+        Scanner sc=new Scanner(System.in);
+        System.out.println("Enter two numbers ");
+        m=sc.nextInt();
+        n=sc.nextInt();
+        p=product(Math.abs(m),Math.abs(n));
+       if((m<0&&n>0)||(m>0&&n<0))
+           p=p*-1;
+        System.out.println(p);
+    }      
+}

day14/Java/Sumrec.java

@@ -0,0 +1,30 @@
+/*
+ * To change this license header, choose License Headers in Project Properties.
+ * To change this template file, choose Tools | Templates
+ * and open the template in the editor.
+ */
+package recursion;
+
+/**
+ * @date 08/01/19
+ * @author SPREEHA DUTTA
+ */
+import java.util.*;
+public class Sumrec {
+    public static int sum(int n)
+    {
+        if(n==0)
+            return 0;
+        else
+            return n%10+sum(n/10);
+    }
+   public static void main(String []args)
+   {
+       int n,s;
+       Scanner sc=new Scanner(System.in);
+       System.out.println("Enter a number");
+       n=sc.nextInt();
+       s=sum(n);
+       System.out.println(s);
+   }
+}

day14/README.md

@@ -90,6 +90,33 @@ public class SumDigits {
 }
 ```
 
+#### [Solution](./Java/Sumrec.java)
+
+/**
+ * @date 08/01/19
+ * @author SPREEHA DUTTA
+ */
+import java.util.*;
+public class Sumrec {
+    public static int sum(int n)
+    {
+        if(n==0)
+            return 0;
+        else
+            return n%10+sum(n/10);
+    }
+   public static void main(String []args)
+   {
+       int n,s;
+       Scanner sc=new Scanner(System.in);
+       System.out.println("Enter a number");
+       n=sc.nextInt();
+       s=sum(n);
+       System.out.println(s);
+   }   
+}
+```
+
 ### C++ Implementation
 
 #### [C++ Solution by @profgrammer](./C++/profgrammer_sumdigits.cpp)
@@ -262,6 +289,37 @@ public class Product {
 }
 ```
 
+#### [Solution](./Java/Recmultiply.java)
+
+```java
+/**
+ * @date 08/01/19
+ * @author SPREEHA DUTTA
+ */
+import java.util.*;
+public class Recmultiply {
+   public static int product(int m,int n)
+   {
+       if (n==0)
+           return 0;
+       else
+           return m+product(m,n-1);
+   }
+    public static void main(String []args)
+    {
+        int m,n,p;
+        Scanner sc=new Scanner(System.in);
+        System.out.println("Enter two numbers ");
+        m=sc.nextInt();
+        n=sc.nextInt();
+        p=product(Math.abs(m),Math.abs(n));
+       if((m<0&&n>0)||(m>0&&n<0))
+           p=p*-1;
+        System.out.println(p);
+    }      
+}
+```
+
 ### C++ Implementation
 
 #### [C++ Solution by @profgrammer](./C++/profgrammer_product.cpp)

day9/dailycodebase

@@ -0,0 +1 @@
+Subproject commit e95480ab4bde1c11326b1a5b925ec0447e821dbb