Fibonacci java program

Fibonacci

Output

1:- 1

2:- 1

3:- 2

4:- 3

5:- 5

6:- 8

7:- 13

8:- 21

9:- 34

10:- 55

11:- 89

12:- 144

13:- 233

14:- 377

15:- 610

Source code

package com.swain.cell;

public class Fibonacci {

        public static long fibonacci(int n) {

               if (n <= 1) return n;

               else return fibonacci(n-1) + fibonacci(n-2);

           }

           public static void main(String[] args) {

               int n=15;

               for (int i = 1; i <= n; i++)

                   System.out.println(i + ":- " + fibonacci(i));

           }

}

Linear Search java program

Linear Search

Output

Linear Search List

44 index  position 7

Source code

package com.swain.cell;

public class LinearSearch {

       public static void main(String[] args)

       {

              System.out.println("Linear Search List");

             

              int[] arr = {0,2879, 15, 29, 78, 26, 24, 44, 167, 13,24,47};

             

              int i;       

              int num = 44;

              boolean flag=false;

             

              for(i=0; i<arr.length; i++){

                     if(arr[i]==num){

                           flag=true;

                           break;

                     }

                    

              }//for

             

              if(flag){

                     System.out.println(num + " index  position "+i);

              }

              else{

                     System.out.println(num + " no not found");

              }

             

       }     

}

Binary Search java program

Binary Search

Output

---------------------------------

ENTER THE NUMBER TO BE SEARCHED

8

ENTER 10 NUMBERS FOR THE ARRAY

12

23

34

56

10

23

23

34

34

45

CONTENTS OF ARRAY ARE

12

23

34

56

10

23

23

34

34

45

NUMBER TO BE SEARCHED IS 8

NUMBER DOES NOT EXIST IN THE ARRAY

Source code

package com.swain.cell;

import java.io.BufferedReader;

import java.io.IOException;

import java.io.InputStreamReader;

public class BinarySearch {

public static void main(String args[])throws IOException{

       int i;

       InputStreamReader x=new InputStreamReader(System.in);

       BufferedReader y=new BufferedReader(x);

       int a[]=new int[10];

       System.out.println("ENTER THE NUMBER TO BE SEARCHED");

       int n=Integer.parseInt(y.readLine());

       System.out.println("ENTER 10 NUMBERS FOR THE ARRAY");

       for(i=0;i<10;i++)

       {

       a[i]=Integer.parseInt(y.readLine());    

   }

   System.out.println("CONTENTS OF ARRAY ARE");

   for(i=0;i<10;i++)

   {

       System.out.println(a[i]);

   }

   System.out.println("NUMBER TO BE SEARCHED IS "+n);

   int p=-1,mid,l=0,u=9;

   while(l<=u)

   {

       mid=(l+u)/2;

       if(a[mid]==n)

       {

              p=mid;

              break;

       }

       else if(n> a[mid])

       {

              l=mid+1;

       }

       else if(n<a[mid])

       {

              u=mid-1;

       }

   }

   if(p==-1)

   {

       System.out.println("NUMBER DOES NOT EXIST IN THE ARRAY");

   }

   else

   {

       System.out.println("NUMBER EXISTS AT THE INDEX "+p);

   }

}

}

Pyramid Program 4

Pyramid Program 4

 Output

----------

1

1 2 1

1 2 4 2 1

1 2 4 8 4 2 1

1 2 4 8 16 8 4 2 1

1 2 4 8 16 32 16 8 4 2 1

1 2 4 8 16 32 64 32 16 8 4 2 1

1 2 4 8 16 32 64 128 64 32 16 8 4 2 1

Pyramid Program 4

Source code

-------------

package com.swain.cell;

public class Piramid4 {

       public static void main(String args[]){

       int i,k,j;

       for(i=1;i<=200;i= i*2){

              for(j=1; j<=i; j=j*2)

              System.out.print(j + " ");

              for(k=i/2; k>=1; k=k/2)

              System.out.print( k + " ");

              System.out.print("\n");

       }

}

}

Pyramid Program 3

Pyramid Program 3

 Output

----------

1

 1 2

 1 2 3

 1 2 3 4

 1 2 3 4 5

 1 2 3 4

 1 2 3

 1 2

 1

Pyramid Program 3

Source code

-------------

package com.swain.cell;

public class Piramid3 {

       public static void main(String args[]){

              int i,j;

              for(i=1;i<=5;i++)

              {

              for(j=1;j<=i;j++)

              System.out.print(" "+j);

              System.out.print("\n");

              }

              for(i=4;i>=1;i--)

              {

              for(j=1;j<=i;j++)

              System.out.print(" "+j);

              System.out.print("\n");

              }

       }

}

Pyramid Program 2

 Output

----------

1

 1 2

 1 2 3

 1 2 3 4

Pyramid Program 2

Source code

-------------

package com.swain.cell;

public class Piramid2 {

       public static void main(String args[]){

       int i,j;

       for(i=1;i<=4;i++)

       {

       for(j=1;j<=i;j++)

       System.out.print(" "+j);

       System.out.print("\n");

       }

       }

}

Pyramid Program 1

Output

----------

    *

   * *

  * * *

 * * * *

* * * * *

Pyramid Program 1

Source code

-------------

package com.swain.cell;

public class Piramid {

       public static void main(String args[]){

              int p=1;

              for(int i=1;i<=5;i++){

                     for(int j=i;j<5;j++){

                           System.out.print(" ");

                     }

                     for(int k=1;k<=p;k++){

                           if(k%2==0){

                                  System.out.print(" ");

                           }else

                           System.out.print("*");

                     }

                     System.out.println();

                     p+=2;

              }

       }

}