柯又寧,Java遞迴函數Recursion=recursive Function+Recursive Methods

public class Main {                  /*柯又寧recursion遞迴函數*/
  public static void main(String[] args) {
    int x=11 ;                       /*Java程式必須以main起始*/
    for(int i=0;i 0) { return k + sum(k - 1);
    } else { return 0;}}            /*函數Sun呼叫自己,稱遞迴*/
  public static int f(int k) {
    if (k > 0) { return k*f(k - 1);
    } else { return 1;}}           /*0!=1, 7!=7*6!,....*/
}