python编程2

1.辗转相除法求最大公约数(greatest common divisor)gcd:

 

迭代算法：

 

Loop. Loop until p = q. Swap. If p < q then swap p and q, p q. Subtract. If p > q then subtract q from p, p ← p − q. Result. Print p

 

代码：

 

#!/usr/bin/env python def gcd(p, q): while p != q: if p < q: p,q = q,p p = p -q print p if __name__ == "__main__": gcd(21,28)

 

递归算法：

(a) Base Case. If p = q: return p.
(b) p < q. If p < q: return GCD(q, p).,
(c) p > q. If p > q: return GCD(p-q, q).

 

代码：

 

#!/usr/bin/env python def gcd(p, q): if p == q: return p elif p < q: return gcd(q,p) else: return gcd(p-q, q) if __name__ == "__main__": print gcd(21,28)

 

2.产生一定范围内的大量随机数。（非原创）：

 

#!/usr/bin/env python3.1 import random def get_int(msg, minimum, default): while True: try: line = input(msg) if not line and default is not None: return default i = int(line) if i < minimum: print("must be >=",minumum) else: return i except ValueError as err: print(err) rows = get_int("rows:",1,None) columns = get_int("columns:",1,None) minimum = get_int("minimum (or Enter for 0):", -1000000,0) default = 1000 if default < minimum: default = 2 * minimum maximum = get_int("maximum (or Enter for "+ str(default) + "):", minimum, default) row = 0 while row < rows: line = "" column = 0 while column < columns: i = random.randint(minimum,maximum) s = str(i) while len(s) < 10: s = " " + s line += s column += 1 print(line) row += 1

 

运行结果：

wolf@debian:~/sourcecode/mycode/python$ ./generate_grid.py rows:4 columns:4 minimum (or Enter for 0):20 maximum (or Enter for 1000):200 77 107 45 191 27 49 93 44 58 108 44 155 118 32 54 69