• Source
    1. import java.util.Scanner;
    2. public class Fibonacci
    3. {
    4. public static void main(String args[])
    5. {
    6. System.out.print("Masukkan banyak angka deret Fibonacci : ");
    7. Scanner input = new Scanner(System.in);
    8. int banyak = input.nextInt();
    9. System.out.print("Deret Fibonacci : \n");
    10. for (int i = 1; i <= banyak; i++) {
    11. System.out.print(fibonaccirekursi(i) + " ");
    12. }
    13. }
    14. public static int fibonaccirekursi(int n) {
    15. if (n == 1 || n == 2)
    16. {
    17. return 1;
    18. }
    19. return fibonaccirekursi(n-1) + fibonaccirekursi(n-2);
    20. }
    21. }