Day-39:While loop practice -5

Example1:[TBD]

package While;

public class Div4 {

    public static void main(String[] args) {

        Looping l=new Looping();

        boolean prime=l.find_prime(17);

        if (prime==true) 
            System.out.println("Prime Number");

        else 
            System.out.println("Not Prime Number");
    }


    private boolean find_Prime(int no) {
        int div =2;
        while (div < no) {
            if (no % div == 0) 
            {
               return false;
            } 
            div++;
        }
        return true;

    }    
}  

Example2:[TBD]

package While;

public class Basepower {

public static void main(String[] args) {
    Looping l =new Looping(); 

    int result = l.find_power(2,5);
    System.out.println(result); 

}
    public int find_power(int base, int power){
        int result = 1;
        while(power>0){
            result = result * base;
            power-=1;
        }
        return result;
    }



}

Example3:[TBD]

package While;

public class Smalldiv { 
    public static void main(String[] args) { 

        Looping l =new Looping(); 

         l.find_common_divisors(2,5);
    }

    private void find_common_divisors(int no1, int no2) {
    // TODO Auto-generated method stub
    int div = 2; 
    int small = 0; 
    if(no1<no2)
        small = no1; 
    else
        small = no2;

    while(div<=small)
    {
    if(no1%div == 0 && no2%div==0)
        System.out.println(div);
    div+=1;
    }       
}

}

Example4:

package While;

public class Smallbreakdiv {

public static void main(String[] args) { 

        Looping l =new Looping(); 

         l.find_common_divisors(2,5);
    }

private void find_common_divisors(int no1, int no2) {
    // TODO Auto-generated method stub
    int div = 2; 
    int small = no1 < no2 ? no1: no2; 
    while(div<=small)
    {
    if(no1%div == 0 && no2%div==0)
    {
        System.out.println(div);
        break;
    }
    div+=1;
    }
}
}

Example5:

package While;

public class smalldiv2 {

public static void main(String[] args) { 

        Looping l =new Looping(); 

         l.find_common_divisors(2,5);
    }

    private void find_common_divisors(int no1, int no2) {
        // TODO Auto-generated method stub
        int last = 0; 
        int div = 2; 

        int small = no1 < no2 ? no1: no2; 
        while(div<=small)
        {
        if(no1%div == 0 && no2%div==0)
        {
            System.out.println(div); 
            last = div;     

        }
        div+=1;
        } 
        System.out.println("Greatest Common Divisor is "+ last);

    }
}