Breaking News: Grepper is joining You.com. Read the official announcement!

exponet

Mero answered on July 30, 2021 Popularity 2/10 Helpfulness 1/10

answer exponet

related exponet

exponet

Comment

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;
        }

        if (n >= 31){
            System.out.println(sum-1);
            int r = multipied(n);
            System.out.println("\nRecursive");
            System.out.println(r-1);
        }else{
            System.out.println(sum);
            int r = multipied(n);
            System.out.println("\nRecursive");
            System.out.println(r);
        }



    }

    public static  int multipied(int n){
        int ans;
        if(n == 0)
            return 1;
        else if(n%2 == 0){
            int k = multipied(n/2);
            ans = k*k;
        }
        ans= 2 * multipied(n-1);

        return ans ;
    }

}

Popularity 2/10 Helpfulness 1/10 Language java

Source: Grepper

Tags: java

Link to this answer
Share Copy Link

Contributed on Jul 30 2021

Mero

0 Answers Avg Quality 2/10

Closely Related Answers

exponet

Comment

public class Recursion {
    public static void main(String[] args) {
        int[] arr = {23,21,321,312,31,23,12,312,312,312,3,18,200000,1};
        int arrSum = 0;
        arrSum= sigma(arr,arr.length-1);

        int sum;
        sum = sigma(arr.length);
        System.out.println("Sum of Array Elements:");
        System.out.println(arrSum+"\n");
        System.out.println("sigma n ==> (Arr.length) \n"+arr.length+"\n"+ sum);
    }


    public static int sigma(int n){
        if(n<=0)
            return n;

        return n + sigma(n-1);


    }

    public static int sigma(int[] arr, int l){

        if(l == 0)
            return arr[l];

        return arr[(l)] + sigma(arr,l-1) ;
    }
}

Popularity 1/10 Helpfulness 1/10 Language java

Source: Grepper

Tags: java

Link to this answer
Share Copy Link

Contributed on Jul 30 2021

Mero

0 Answers Avg Quality 2/10

exponet

Contents

More Related Answers

exponet

Closely Related Answers

exponet

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.