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

11 votes308 views1 answer
Java one line if else
Java
0 vote313 views1 answer
String vs new string
Java
0 vote320 views1 answer
Jframe centerlaized
Java
2 votes318 views2 answers
Java file dialog
Java
0 vote317 views1 answer
Android setTextColor not working
Java
17 votes309 views5 answers
Constructor
Java
1 vote320 views1 answer
Java Scrip
Java
0 vote302 views1 answer
Cannot invoke toString() on the primitive type int
Java
0 vote339 views1 answer
Delete Specials Caractères from a String in java
Java
1 vote342 views1 answer
Comparable
Java