Presentation is loading. Please wait.

Presentation is loading. Please wait.

Minnet (=stacken) public static int fac(int n) { if (n == 0) return 1; else return fac(n-1) * n; }..... main(String [] a) { int x; x = fac(3); System.out.println(x);

Similar presentations


Presentation on theme: "Minnet (=stacken) public static int fac(int n) { if (n == 0) return 1; else return fac(n-1) * n; }..... main(String [] a) { int x; x = fac(3); System.out.println(x);"— Presentation transcript:

1 Minnet (=stacken) public static int fac(int n) { if (n == 0) return 1; else return fac(n-1) * n; }..... main(String [] a) { int x; x = fac(3); System.out.println(x); }

2 Minnet (=stacken)..int fac(int n) { if (n == 0) return 1; else return fac(n-1) * n; }.. main(..) { int x; x = fac(3); System.out.println(x); } Top x

3 Minnet (=stacken) int fac(int n) { if (n == 0) return 1; else return fac(n-1) * n; }.. main(..) { int x; x = fac(3); System.out.println(x); } Top x (ret) n ?3?3

4 Minnet (=stacken) int fac(int n) { if (n == 0) return 1; else return fac(n-1) * n; }.. main(..) { int x; x = fac(3); System.out.println(x); } Top ?3?3 x (ret) n

5 Minnet (=stacken) int fac(int n) { if (n == 0) return 1; else return fac(n-1) * n; }.. main(..) { int x; x = fac(3); System.out.println(x); } Top ?3?2?3?2 x (ret) n (ret) n

6 Minnet (=stacken) int fac(int n) { if (n == 0) return 1; else return fac(n-1) * n; }.. main(..) { int x; x = fac(3); System.out.println(x); } Top ?3?2?3?2 x (ret) n (ret) n

7 Minnet (=stacken) int fac(int n) { if (n == 0) return 1; else return fac(n-1) * n; }.. main(..) { int x; x = fac(3); System.out.println(x); } Top ?3?2?1?3?2?1 x (ret) n (ret) n (ret) n

8 Minnet (=stacken) int fac(int n) { if (n == 0) return 1; else return fac(n-1) * n; }.. main(..) { int x; x = fac(3); System.out.println(x); } Top ?3?2?1?3?2?1 x (ret) n (ret) n (ret) n

9 Minnet (=stacken) int fac(int n) { if (n == 0) return 1; else return fac(n-1) * n; }.. main(..) { int x; x = fac(3); System.out.println(x); } Top ?3?2?1?0?3?2?1?0 x (ret) n (ret) n (ret) n (ret) n

10 Minnet (=stacken) int fac(int n) { if (n == 0) return 1; else return fac(n-1) * n; }.. main(..) { int x; x = fac(3); System.out.println(x); } Top ?3?2?1?0?3?2?1?0 x (ret) n (ret) n (ret) n (ret) n

11 Minnet (=stacken) int fac(int n) { if (n == 0) return 1; else return fac(n-1) * n; }.. main(..) { int x; x = fac(3); System.out.println(x); } Top ?3?2?110?3?2?110 x (ret) n (ret) n (ret) n (ret)

12 Minnet (=stacken) int fac(int n) { if (n == 0) return 1; else return fac(n-1) * n; }.. main(..) { int x; x = fac(3); System.out.println(x); } Top ?3?21110?3?21110 x (ret) n (ret) n (ret) n (ret)

13 Minnet (=stacken) int fac(int n) { if (n == 0) return 1; else return fac(n-1) * n; }.. main(..) { int x; x = fac(3); System.out.println(x); } Top ?3?21110?3?21110 x (ret) n (ret) n (ret)

14 Minnet (=stacken) int fac(int n) { if (n == 0) return 1; else return fac(n-1) * n; }.. main(..) { int x; x = fac(3); System.out.println(x); } Top ?3221110?3221110 x (ret) n (ret) n (ret)

15 Minnet (=stacken) int fac(int n) { if (n == 0) return 1; else return fac(n-1) * n; }.. main(..) { int x; x = fac(3); System.out.println(x); } Top ?3221110?3221110 x (ret) n (ret)

16 Minnet (=stacken) int fac(int n) { if (n == 0) return 1; else return fac(n-1) * n; }.. main(..) { int x; x = fac(3); System.out.println(x); } Top 6322111063221110 x (ret) n (ret)

17 Minnet (=stacken) int fac(int n) { if (n == 0) return 1; else return fac(n-1) * n; }.. main(..) { int x; x = fac(3); System.out.println(x); } Top 6322111063221110 x (ret)

18 Minnet (=stacken) int fac(int n) { if (n == 0) return 1; else return fac(n-1) * n; }.. main(..) { int x; x = fac(3); System.out.println(x); } Top 6322111063221110 x 6


Download ppt "Minnet (=stacken) public static int fac(int n) { if (n == 0) return 1; else return fac(n-1) * n; }..... main(String [] a) { int x; x = fac(3); System.out.println(x);"

Similar presentations


Ads by Google