public class RecursionEx
{ 




 
   public int factorial(int upTo){
       int __factorial =1;
        for(int i=1;i<= upTo; i++)
            __factorial *= i;
   return __factorial ;
  }


    public int factorialRecursor(int upTo){
    if(upTo ==1)
        return 1;
     else
        return upTo * factorialRecursor(upTo-1) ;
   }


   
public RecursionEx(){
    System.out.println(factorialRecursor(5));
    System.out.println(factorial(5));
   
     System.out.println (separateWithCommas("abcdefghijkl"));

}

//ASSIGNMENTS ARE BELOW HERE

public  String separateWithCommasRecursively(String aStr){

return "";
}


public  String separateWithCommas(String aStr){
String returnString ="";
for(int i = 0 ; i < aStr.length() -1 ; ++i)
    returnString += (aStr.substring(i,i+1) + ", ");
 
    return returnString; 
}



public int findSum(int upTo){
return 1;

}


public int findSumRecursive(int upTo){
return 1;
}
    



 

//if you want an A do this
//look up what a fibonacci number iss at wikepedia.
public int getNthFibonacciRecursively( int n ){
		 
}

//want an A+  then go to link below( link is live on our home page and complete the assignment)
//http://www.mathwarehouse.com/apcs/recursion-lesson-and-lab/recursion-project-pascals-triangle.php