python选择,冒泡,插叙排序方式
2018-04-02 20:40
316 查看
选择排序:import randomdef select_sort(li): for i in range(len(li) - 1): min_loc = i for j in range(i+1, len(li)): if li[min_loc] > li[j]: min_loc = j if min_loc != i: li[i] , li[min_loc] = li[min_loc] , li[i]
data = list(range(1000))random.shuffle(data)select_sort(data)print(data)
冒泡排序:import random
# def bubble_sort(li):# for i in range(len(li) - 1):# for j in range(len(li) - i - 1):# if li[j] > li[j+1]:# li[j], li[j+1] = li[j+1], li[j]
def bubble_sort_1(li): for i in range(len(li) - 1): exchange = False for j in range(len(li) - i - 1): if li[j] > li[j+1]: li[j], li[j+1] = li[j+1], li[j] exchange = True if not exchange: break
data = list(range(1000))random.shuffle(data)# bubble_sort(data)bubble_sort_1(data)print(data)
插叙排序:# import random# def insert_sort(li):# for i in range(1,len(li)):# tmp = li[i]# j = i - 1# while j >= 0 and li[j] < tmp:# li[j+1]=li[j]# j = j - 1# li[j+1] = tmp## data = list(range(1000))# random.shuffle(data)# insert_sort(data)# print(data)
num1 = [36,52,1,9,43]for i in range(1,len(num1)): j = i - 1 if num1[i] < num1[j]: temp = num1[i] num1[i] = num1[j]
j = j - 1 while j >= 0 and temp < num1[j]: num1[j+1] = num1[j] j = j - 1 num1[j+1] = tempprint(num1)
data = list(range(1000))random.shuffle(data)select_sort(data)print(data)
冒泡排序:import random
# def bubble_sort(li):# for i in range(len(li) - 1):# for j in range(len(li) - i - 1):# if li[j] > li[j+1]:# li[j], li[j+1] = li[j+1], li[j]
def bubble_sort_1(li): for i in range(len(li) - 1): exchange = False for j in range(len(li) - i - 1): if li[j] > li[j+1]: li[j], li[j+1] = li[j+1], li[j] exchange = True if not exchange: break
data = list(range(1000))random.shuffle(data)# bubble_sort(data)bubble_sort_1(data)print(data)
插叙排序:# import random# def insert_sort(li):# for i in range(1,len(li)):# tmp = li[i]# j = i - 1# while j >= 0 and li[j] < tmp:# li[j+1]=li[j]# j = j - 1# li[j+1] = tmp## data = list(range(1000))# random.shuffle(data)# insert_sort(data)# print(data)
num1 = [36,52,1,9,43]for i in range(1,len(num1)): j = i - 1 if num1[i] < num1[j]: temp = num1[i] num1[i] = num1[j]
j = j - 1 while j >= 0 and temp < num1[j]: num1[j+1] = num1[j] j = j - 1 num1[j+1] = tempprint(num1)
相关文章推荐
- python选择,冒泡,插叙排序方式
- python选择,冒泡,插叙排序方式
- python选择,冒泡,插叙排序方式
- 排序算法(三)冒泡、选择排序的Python实现及算法优化详解 推荐
- 《面试》 几种经典的简单的排序方法(冒泡,选择,插入)python实现
- 史上最简单!冒泡、选择排序的Python实现及算法优化详解
- python写基础排序:冒泡、插入、选择
- Python实现冒泡,插入,选择排序简单实例
- Python实现冒泡,选择排序
- Python实现冒泡,插入,选择排序简单实例
- 排序的三种方式(冒泡,插入,和选择)
- [Python-算法]python实现冒泡,插入,选择排序
- 再看冒泡和选择排序以及折半查找(二分查找)
- 冒泡排序 选择排序 快速排序(C语言)
- 数组排序(冒泡、选择、插入、快排、希尔、桶排序、堆排序)
- 冒泡排序、交换排序、选择排序、插入排序、快速排序、SHELL排序
- 冒泡,插入,折半插入,希尔,快速,简单选择排序的源代码总结
- C语言排序实例(选择、冒泡、插入、折半、快速)
- java:三种经典大排序汇总,冒泡,插入,选择
- javaSE基础编程——排序(冒泡,选择)