陳家穎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;} } /*函數sum呼叫自己,稱遞迴*/
public static int f(int k) {
if (k > 0) {return k * f(k - 1);}
else {return 1;} } /*0!=1,7!=7*6!,....*/
}


留言
張貼留言