/** * Fibonacci using recursion by B. Yue */ package edu.uhcl.sce.yue.simple; public class Fibonacci { public static int Fab(int n) { if (n <= 2) return 1; return FabHelper(n,2,1,1); } private static int FabHelper(int n, int k, int fk, int fk_1) { if (n == k) return fk; else return FabHelper(n, k+1, fk + fk_1, fk); } public static void main (String args[]) { System.out.println("F10: " + Fab(10)); System.out.println("F13: " + Fab(13)); System.out.println("F23: " + Fab(23)); } }