2 multiples recursion

import java.util.Scanner;

public class multipied {
    public static Scanner scanner = new Scanner (System.in);
    public static void main(String[] args) {
        System.out.println("Enter int");
        int n = scanner.nextInt();
        int sum = 1;
        System.out.println("For loop");
        for(int i = 0 ; i < n ; ++i ){
            if(n == 0){
                System.out.println(sum+'\n');
                break;
            }
            sum*=2;
        }
        System.out.println(sum);
        int r = multipied(n);
        System.out.println("\nRecursive");
        System.out.println(r);
        ;

    }

    public static  int multipied(int n){

        if(n ==0)
            return 1;

        return 2 * multipied(n-1);
    }

}

Similar codes

2 votes176 views1 answer
Java guid
Java
0 vote208 views2 answers
Connect 2 package in android
Java
2 votes255 views3 answers
Add comment in java
Java
1 vote175 views1 answer
Java swing absolute position
Java
1 vote173 views1 answer
Why can we implement multiple interfaces
Java
0 vote188 views1 answer
Cosinus-1 java
Java
1 vote259 views2 answers
IllegalStateException: Cannot load driver class: oracle.jdbc.driver.OracleDriver
Java
4 votes297 views1 answer
Context path spring boot
Java Spring
0 vote160 views1 answer
Java date equals other date
Java
1 vote197 views1 answer
Java mouseclick
Java