謝宇哲java遞迴函數recursion=recursive function=recursive method
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!,...*/
}

留言
張貼留言