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

java recursion

Add Answer

Cute Camel answered on January 7, 2020 Popularity 10/10 Helpfulness 1/10

answer java recursion

related recursion in java

related java recursion

related recursive in java

related Recursion in java

related recursive in java

related recursion java

related Recursion examples Java

java recursion

Comment

public void removeDigits(String string) {
  if(string.length == 1) {
    if(Character.isDigit(string.CharAt(0))) {
      return "";
    } else {
      return string;
    }
  } else {
    if(Character.isDigit(string.CharAt(0))) {
      return removeDigits(string.substring(1));
    } else {
      return string.substring(0, 1) + removeDigits(string.substring(1));

public static void main(String[] args) {
  String string = "1a2b3c"
  System.out.println(removeDigits(string)); //will print "abc"
}

Popularity 10/10 Helpfulness 1/10 Language java

Source: Grepper

Tags: java recursion

Link to this answer
Share Copy Link

Contributed on May 21 2020

Cute Camel

0 Answers Avg Quality 2/10

Closely Related Answers

recursion in java

Comment

class scratch{
    public static long factorial(int n){
        if ( n == 1 ){
            return 1;
        }
        else{
            return n * factorial( n - 1 );
        }
    }
    public static void main(String[] args) {
        System.out.println( factorial(5) );
        //Print 120 (5!) to the console
    }
}

Popularity 10/10 Helpfulness 3/10 Language java

Source: Grepper

Tags: java

Link to this answer
Share Copy Link

Contributed on Jan 07 2020

Nitbit25

0 Answers Avg Quality 2/10

java recursion

Comment

public static long factorial(int n) { 
    if (n == 1) return 1; //base case
    return n * factorial(n-1); 
}

Popularity 10/10 Helpfulness 3/10 Language java

Source: introcs.cs.princeton.edu

Tags: java

Link to this answer
Share Copy Link

Contributed on Oct 12 2021

Magnificent Monkey Adi

0 Answers Avg Quality 2/10

java recursion

Comment

// prints x number of $
public static void recursion(int x) {
  if(x == 0) { // base case
    System.out.println();
  } else { // recursive case
    System.out.print("$");
    recursion(x - 1);
  }
}

Popularity 10/10 Helpfulness 2/10 Language java

Source: Grepper

Tags: java

Link to this answer
Share Copy Link

Contributed on May 27 2020

Abbot Of Boolean Zen

0 Answers Avg Quality 2/10

recursive in java

Comment

int fact(int n)
{
    if (n < = 1) // base case
        return 1;
    else    
        return n*fact(n-1);    
}

Popularity 8/10 Helpfulness 2/10 Language java

Source: www.geeksforgeeks.org

Tags: java

Link to this answer
Share Copy Link

Contributed on Feb 06 2023

Vicky Rudani

0 Answers Avg Quality 2/10

Recursion in java

Comment

public class RecursionExample2 {  
static int count=0;  
static void p(){  
count++;  
if(count<=5){  
System.out.println("hello "+count);  
p();  
}  
}  
public static void main(String[] args) {  
p();  
}  
}

Popularity 9/10 Helpfulness 1/10 Language java

Source: Grepper

Tags: java

Link to this answer
Share Copy Link

Contributed on Jun 20 2022

fathi emad eldin

0 Answers Avg Quality 2/10

recursive in java

Comment

void f() {
    ... g() ...
}
	
void g() {
   ... f() ...
}

Popularity 9/10 Helpfulness 1/10 Language java

Source: pages.cs.wisc.edu

Tags: java

Link to this answer
Share Copy Link

Contributed on Sep 16 2022

jeelan fakruddin

0 Answers Avg Quality 2/10

recursive in java

Comment

void f() {
    ... g() ...
}
	
void g() {
   ... f() ...
}

Popularity 9/10 Helpfulness 1/10 Language java

Source: pages.cs.wisc.edu

Tags: java

Link to this answer
Share Copy Link

Contributed on Sep 16 2022

jeelan fakruddin

0 Answers Avg Quality 2/10

recursion java

Comment

//recursion 

void setup() {
  size(500,500);
  background(#0F0E04);
  noLoop();
  fill(#FF5500);
  circles(width/2 , height/2, 200,1.0/3);
  
}
void circles(float x , float y, float diam, float factor){
  circle(x,y,diam);
  if (diam>=3){
    //right circles
    circles(x+.5*diam,y,factor*diam,factor);
    //left circles
    circles(x-.5*diam,y,factor*diam,factor);
    
    //top circles
    circles(x,y+.5*diam,factor*diam,factor);
    //bottom circles
    circles(x,y-.5*diam,factor*diam,factor);    
  }
}

Popularity 9/10 Helpfulness 1/10 Language java

Source: Grepper

Tags: java recursion

Link to this answer
Share Copy Link

Contributed on Oct 20 2022

An7wan

0 Answers Avg Quality 2/10

recursion java

Comment

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

        return ans ;
    }

Popularity 10/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

Recursion examples Java

Comment

public static void countDown(int number){
        if (number == 0) {
            System.out.println(number);
        } else {
            System.out.println(number);
            countDown(number - 1);
        }
 }

Popularity 9/10 Helpfulness 1/10 Language java

Source: www.java67.com

Tags: java

Link to this answer
Share Copy Link

Contributed on Dec 13 2021

Wide-eyed Whale

0 Answers Avg Quality 2/10

java recursion

Contents

More Related Answers

java recursion

Closely Related Answers

recursion in java

java recursion

java recursion

recursive in java

Recursion in java

recursive in java

recursive in java

recursion java

recursion java

Recursion examples Java

Grepper

Documentation

Social

Legal

Contact

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