Recursion

[kathyla18]

Hi, i want to know how this recursion is executing

class P5PartA {  
   public static void main(String args[]) {    
   String data = new String("01101101");    
   System.out.println("Conversion:  " + conversion(data));  
   }  
   public static double conversion(String data) {   
   return conversion(data, 0);  
    }  
   public static double conversion(String data, int index) {    
   double result;   
   int bit = Integer.parseInt(data.substring(data.length() - 1));    
   bit = bit * 2;    
   if (data.length() == 1) {      
   return Math.pow(bit, index);    
   }    
   result = conversion(data.substring(0, data.length() - 1), index + 1);     
   if (bit != 0) {     
   result = result + Math.pow(bit, index);   
   }    
return result;  
}
}

Can someone please step through its execution showing the recursive process and the state of the system as it changes.

[OrangeDog]

What is stopping you from doing it yourself?

[Eranga]

Take a piece of paper and write-down what each line of this code do. If you really stuck on something ask your question at the time. We'll help you to find the solution.

This is not a bulky code lol. Just have a try first and show your effort.