九九乘法表
for i in range(1, 10):
for j in range(1, i + 1):
result = i * j
print(i, "*", j, "=", result, " ", "\t", end="")
print("")
在for循环中,取值区间为左闭右开 [ )
冒泡排序
把列表按从小到大的顺序排序
# 冒泡排序
alist = [3, 4, 6, 7, 9, 2, 5, 1, 8]
alistLen = len(alist)
for i in range(1, alistLen):
for j in range(0, alistLen - 1):
if (alist[j] > alist[j + 1]):
temp = alist[j]
alist[j] = alist[j + 1]
alist[j + 1] = temp
print(alist)
列表从大到小的顺序排序
alist = [3, 4, 6, 7, 9, 2, 5, 1, 8]
alistLen = len(alist)
for i in range(1, alistLen):
for j in range(0, alistLen - 1):
if (alist[j] < alist[j + 1]):
temp = alist[j]
alist[j] = alist[j + 1]
alist[j + 1] = temp
print(alist)
折半查找
def search(a, ls):
left = 0
right = len(ls) - 1
mid = (left + right) // 2
while left <= right:
if (a > ls[mid]):
left = mid + 1
elif (a < ls[mid]):
right = mid - 1
else:
# print("找到该数字")
return 1
break
mid = (left + right) // 2
if (left > right):
# print("没有找到该数字")
return 0
a = int(input("请输入数字"))
ls = [1, 3, 5, 7, 9, 11, 13]
result = search(a, ls)
if result == 1:
print("找到该数字")
else:
print("未找到该数字")