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

-1 vote365 views2 answers
4år9pv8y0o¥¡\c9Ré¨
Java
0 vote245 views1 answer
Android sqlite insert or replace
Java
0 vote250 views1 answer
Check folder for files java
Java
0 vote304 views1 answer
Spring security auto login after register
Java Spring
0 vote246 views2 answers
Print line number java
Java
0 vote252 views1 answer
Create all possible substrings of a string java
Java
0 vote267 views1 answer
How to use int
Java
0 vote268 views1 answer
Android remove focus from an element
Java
0 vote254 views1 answer
Madrid
Java
1 vote266 views1 answer
Get value of string java
Java