Pm

Recursion/fibonaccirecursive.java

@@ -0,0 +1,30 @@
+import java.util.*;
+class fibonaccirecursive
+{
+
+    public static int fib(int n)
+
+
+    {
+        if (n==1)
+        return 0;
+        else if(n==2)
+        return 1;
+        else if(n>2)
+        return fib(n-1)+fib(n-2);
+        else
+        return -1;
+    }
+    public static void main(String args[])
+    {
+        Scanner sc=new Scanner(System.in);
+        int term;
+        int m=sc.nextInt();
+        fibonaccirecursive obj=new fibonaccirecursive();
+        for(int i=1;i<=m;i++)
+        {
+            term=obj.fib(i);
+            System.out.println(term+",");
+        }
+    }
+}

Recursion/palindromerecurse.java

@@ -0,0 +1,24 @@
+//java program to check whether a number is "palindrome" or not using "recursion" technique.
+
+import java.util.*;
+class palindromerecurse
+{
+    static int rev(int n,int temp)
+    {
+        if(n==0)
+        return temp;
+        temp=(temp*10)+n%10;
+        return rev(n/10,temp);
+    }
+    public static void main()
+    {
+        Scanner sc=new Scanner(System.in);
+        System.out.println("Enter a number:");
+        int n=sc.nextInt();
+        int revnum=rev(n,0);
+        if(revnum==n)
+        System.out.println("palindrome");
+        else
+        System.out.println("not palindrome");
+    }
+}