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 vote112 views1 answer
Count occurrences in seven integers using java single dimension arrays
Java
0 vote124 views1 answer
Buffered reader for big integer
Java
0 vote105 views1 answer
Java spring username encode and decode
Java
1 vote118 views2 answers
Multidimensional arrays java
Java
0 vote118 views1 answer
Plot vector field in java
Java
4 votes96 views2 answers
Java random string
Java
0 vote97 views1 answer
Convert linkedlist to integer array java
Java
5 votes99 views5 answers
Arraylist to int array conversion in java
Java
1 vote119 views1 answer
Java integer to binary string with leading zeros
Java
1 vote99 views1 answer
Java flatten list
Java