/*
 *  Copyright (C) 2009  E.Albert, P.Arenas, S.Genaim, G.Puebla, and D.Zanardini
 *                      https://costa.ls.fi.upm.es
 *
 *  This program is free software: you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation, either version 3 of the License, or
 *  (at your option) any later version.
 *
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
package pubs;
/**
 * This class implements a method for recursively computing 
 * the power operation.
 * 
 * @author E.Albert, P.Arenas, S.Genaim, and G.Puebla
 * 
 */
class Power {

	static int power(int x,int n){ 
		if (n<=0) return 1;
		else return x*power(x,n-1);
	}

	public static void main(String[] args) {

		// First test
		int a = 3;
		int n = 10;
		int result = power(a,n);
		System.out.println("Result: "+result);

		// Second test
		n = 50;
		result = power(a,n);
		System.out.println("Result: "+result);

		// Third test
		n = 100;
		result = power(a,n);
		System.out.println("Result: "+result);
	}

}