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

6 votes219 views2 answers
Abstract vs interface java
Java
-2 votes264 views1 answer
How to add all list elements at once in java
Java
0 vote282 views1 answer
Java tamanho de um vetor
Java
1 vote273 views1 answer
Java look and feel system
Java
1 vote264 views1 answer
Programmation android avoir acces à la liste des instants de partage
Java
5 votes275 views1 answer
What is primitive data type in java
Java
0 vote328 views1 answer
How to add classpath in spring boot
Java
1 vote303 views1 answer
@SpringBootApplication
Java
3 votes267 views4 answers
String array to arraylist
Java
0 vote341 views2 answers
Java how to create subclass
Java