FilesExpand file tree

 python

/

Recursive_01.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

36 lines (27 loc) · 833 Bytes

 python

/

Recursive_01.py

Copy path

Top

File metadata and controls

• Code
• Blame

36 lines (27 loc) · 833 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

# -*- coding: utf-8 -*-

__author__ = 'k22li'

"""

如果函数包含了对其自身的调用，该函数就是递归的。根据 Aho, Sethi, 和 Ullman, ”[a] 如

果一个新的调用能在相同过程中较早的调用结束之前开始，那么该过程就是递归的“

"""

def factorial(n):

if n in [0,1]:

return 1

else:

return n*factorial(n-1)

c = factorial(10)

print c

"""

我们现在可以看到阶乘是递归的，因为 factorial(N) = N* factorial(N-1).换句话说，为了获

得 factorial(N)的值，需要计算 factorial(N-1).而且，为了找到 factorial(N-1)，需要计算

factorial(N-2)等等。

"""

def sumCalc(n):

if n == 1:

sum = 1

else:

sum = n + sumCalc(n-1)

return sum

if __name__ == '__main__':

testSum = sumCalc(1000)

print testSum