1 from math import sqrt
2 def is_prime(i):
3 if i == 2:
4 return True
5 elif i<2:
6 return False
7 elif i%2 == 0:
8 return False
9 else:
10 for n in range(3,int(sqrt(i)+1),2):
11 if i%n == 0:
12 return False
13 return True
这里用到了math包的sqrt,为了尽可能提高效率,少循环几次,这里有个range函数,有三个参数,分别是起点,终点,间隔,间隔是可选的,像range(0,12,3就是[0,3,6,9]。
第二个是冒泡排序,还是上代码:
import random
list = range(0,10)
for i in list:
print (i)
random.shuffle(list)
for i in list:
print (i)
for d in range(len(list)-1,0,-1):
for e in range(0,d,1):
if list[e] > list[e+1]:
list[e],list[e+1] = list[e+1],list[e]
for i in list:
print (i)
def volid(pwd):
a = any(map(str.isupper,pwd))
b = any(map(str.islower,pwd))
c = any(map(str.isdigit,pwd))
d = not all(map(str.isalnum,pwd))
if sum([a,b,c,d])>1:
return True
else:
return False