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

0 vote190 views1 answer
How to change background color of grid in grid layout in android
Java
0 vote193 views1 answer
Java 8 anymatch two lists
Java
0 vote179 views1 answer
Convert int to double with 2 decimal places java
Java
0 vote201 views1 answer
Set top corner of shape radius programmatically android
Java
0 vote193 views1 answer
Java setting logging with rotation logback
Java
5 votes193 views6 answers
Spring boot tutorial
Java
16 votes208 views5 answers
Java reverse array
Java
12 votes179 views2 answers
Java date time
Java
1 vote199 views2 answers
Java responseentity
Java
-1 vote191 views1 answer
/bin/sh 1 java not found docker
Java