汉语版:我们将使用Python来实现内部排序的几个算法,很容易就实现了各种内部排序。
E-Version: here are some inner sort method including bubble sort, select sort, insert sort, quick sort, merge sort ,heap sort and other sort method. we can implement them easily by using python. I will just post some codes and you can copy or paste them in your code lines. but you should prepare that not all the codes are right , some codes contains errors if you check it carefully, you will find them.
一:冒泡排序
# 冒泡排序
def bubble_sort(sort_number=[], sort_type='false'):
result = []
length = len(sort_number)
while length > 0:
for j in range(length-1):
if sort_number[j] > sort_number[j+1]:
sort_number[j], sort_number[j+1] = sort_number[j+1], sort_number[j]
length -= 1
print(sort_number)
result.append(sort_number.copy())
print(result)
return result
二:选择排序
# 选择排序
def select_sort(sort_number=[], sort_type='false'):
result = []
for i in range(len(sort_number)):
min_index = i
for j in range(i+1, len(sort_number)):
if sort_number[min_index] > sort_number[j]:
min_index = j
if min_index != i:
sort_number[min_index], sort_number[i] = sort_number[i], sort_number[min_index]
print(sort_number)
result.append(sort_number.copy())
print(result)
return result
三:插入排序
# 插入排序
def insert_sort(sort_number=[], sort_type='false'):
result = []
for i in range(1, len(sort_number)):
for j in range(i, 0, -1):
if sort_number[j] < sort_number[j-1]:
sort_number[j], sort_number[j-1] = sort_number[j-1], sort_number[j]
print(sort_number)
re