@@ -0,0 +1,2136 @@
+/*%0A * The MIT License (MIT)%0A * %0A * Copyright (c) 2015 Southern Nazarene University Computer Science/Network Engineering Department%0A * %0A * Permission is hereby granted, free of charge, to any person obtaining a copy%0A * of this software and associated documentation files (the %22Software%22), to deal%0A * in the Software without restriction, including without limitation the rights%0A * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell%0A * copies of the Software, and to permit persons to whom the Software is%0A * furnished to do so, subject to the following conditions:%0A * %0A * The above copyright notice and this permission notice shall be included in all%0A * copies or substantial portions of the Software.%0A * %0A * THE SOFTWARE IS PROVIDED %22AS IS%22, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR%0A * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,%0A * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE%0A * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER%0A * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,%0A * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE%0A * SOFTWARE.%0A */%0Apackage edu.snu.csne.csne2543.recursion;%0A%0Apublic class FactorialCalculator%0A%7B%0A%09public int recursiveFactorial( int n )%0A%09%7B%0A%09%09// Default to base case%0A%09%09int result = 1;%0A%09%09%0A%09%09// Do we make a recursive call?%0A%09%09if( 1 %3C n )%0A%09%09%7B%0A%09%09%09// Yes!%0A%09%09%09result = n * recursiveFactorial( n - 1 );%0A%09%09%7D%0A%09%09%0A%09%09return result;%0A%09%7D%0A%09%0A%09public int iterativeFactorial( int n )%0A%09%7B%0A%09%09// Default to 1%0A%09%09int result = 1;%0A%09%09%0A%09%09// Iterate through all the values from 1 to n%0A%09%09for( int i = 1; i %3C= n; i++ )%0A%09%09%7B%0A%09%09%09result = result * i;%0A%09%09%7D%0A%09%09%0A%09%09return result;%0A%09%7D%0A%09%0A%09public static void main( String%5B%5D args )%0A%09%7B%0A%09%09FactorialCalculator calculator = new FactorialCalculator();%0A%09%09%0A%09%09int recursiveFactorialResult = recursiveFactorial( 5 );%0A%09%09System.out.println( %22Recursive: 5!=%5B%22%0A%09%09%09%09+ recursiveFactorialResult%0A%09%09%09%09+ %22%5D%22 );%0A%0A%09%09int iterativeFactorialResult = iterativeFactorial( 5 );%0A%09%09System.out.println( %22Iterative: 5!=%5B%22%0A%09%09%09%09+ iterativeFactorialResult%0A%09%09%09%09+ %22%5D%22 );%0A%0A%09%7D%0A%7D

Create FactorialCalculator.java