//
//	sum(n) = sum(n-1) + 1/n		if n>1
//					= 1							if n==1
//
//	Recusion. P.135
//

class RecursionFractionSum
{
	public static double sum(double n)
	{
		if (n==1) return 1;
		else
				return 1.0/n+sum(n-1);
	}
	public static void main(String[] args)
	{
		double ans = sum(2);	// 1.5


		System.out.println("sum = " + ans);

		System.out.println("\n\nDone.\n\n");
	}
}