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 vote264 views2 answers
Https://github.com/nuxt/nuxt.js/issues/8315#:~:text=%3Chtml%20lang%3D%22ru%22%20data%2Dn%2Dhead%3D%22%257B%2522lang%2522%3A%257B%2522ssr%2522%3A%2522ru%2522%257D%257D%22%3E
Java
0 vote273 views1 answer
Java put space in string after n characters
Java
2 votes306 views1 answer
Charcodeat java
Java
1 vote263 views2 answers
Set icon to fab programmatically in android studio
Java
0 vote300 views1 answer
Java sort arraylist of floats
Java
-1 vote265 views1 answer
Get spring application context
Java
0 vote291 views1 answer
H2-in-mem
Java
12 votes264 views5 answers
Initialize hashmap with values
Java
3 votes263 views1 answer
Advantages of using Java
Java
0 vote339 views1 answer
Webmvctest vs springboottest
Java Spring