冒泡排序
def bubbleSort(q):
for i in range(len(q) - 1):
for j in range(len(q) - i - 1):
if q[j] > q[j + 1]:
q[j], q[j + 1] = q[j + 1], q[j]
q = [1, 3, 5, 6, 7, 3, 9, 3]
bubbleSort(q)
print(q)
选择排序
def selectionSort(q):
for i in range(len(q) - 1):
index = i
for j in range(i + 1, len(q)):
if q[j] < q[index]:
index = j
q[index], q[i] = q[i], q[index]
q = [1, 3, 5, 6, 7, 3, 9, 3]
selectionSort(q)
print(q)
插入排序
def insertionSort(q):
for i in range(1, len(q)):
val = q[i]
index = i - 1
while index >= 0 and q[index] > val:
q[index + 1] = q[index]
index -= 1
q[index + 1] = val
q = [1, 3, 5, 6, 7, 3, 9, 3]
insertionSort(q)
print(q)