1.排序
排序的种类和方式:内置排序,冒泡排序(o(n^2)) ,插入排序 ,选择排序 , 希尔排序 ,堆排排序 ,快排排序, 归并排序
(1)内置排序:
内存地址一样
a = [9,5,8,7,4,3,1,6,2,0]
a.sort()
print(a)
内存地址不一样
a = [9,5,8,7,4,3,1,6,2,0]
b = sorted(a)
print(b)
(3)冒泡排序:
简单的冒泡排序,把一个数固定然后比较 确定最小值
a = [5,8,9,3,2]
for i in range(len(a)-1):
for j in range(i+1,len(a)):
if a[i]>a[j]:
temp = a[i]
a[i] = a[j]
a[j] = temp
del temp
print(a)
比较相邻两个数 ,确定最大值
a = [5,8,9,3,2]
for i in range(len(a)-1):
for j in range(len(a)-1-i):
if a[j]>a[j+1]:
temp = a[j]
a[j] = a[j+1]
a[j+1] = temp
del temp
print(a)
节省运算时间
a = [1,2,3,4,5,6,8,9,7]
count = 0
for i in range(len(a)-1):
flase = False
count += 1
for j in range(len(a)-1-i):
if a[j]>a[j+1]:
temp = a[j]
a[j] = a[j+1]
a[j+1] = temp
del temp
flag = True
if not flag:
break
print(count)
print(a)
(3)选择排序
a = [5,8,9,3,2]
for i in range(0,len(a)-1):
min_index = i
for j in range(i+1,len(a)):
if a[min_index]>a[j]:
min_index = j
if min_index != i:
temp = a[i]
a[i] = a[min_index]
a[min_index] = temp
del temp
print(a)