常见排序算法-Python实现
python
排序
算法
1.二分法
python 32行
- right = length-
- :
- ]
- ):
- test_list = [,,,,,,]
- test_val1 =
- test_val2 =
- ):
- length = len(array)
- :
- :
- ):
- ]:
- array[i],array[i+] = array[i+],array[i]
- length -=
- :
- :
- ):
- ]:
- array[i],array[i+] = array[i+],array[i]
- length -=
- ):
- is_sorted = :
- ):
- is_sorted = ]:
- array[i],array[i+] = array[i+],array[i]
- is_sorted =
- :
- ):
- is_sorted = ]:
- array[i],array[i+] = array[i+],array[i]
- is_sorted =
- , , , , , , , , , ]
- print(better_bubble_sort(test,))
3.插入排序
python 19行
- ]
- ,length):
- ]:
- flag = array[x]
- y = x
- ] > flag :
- array[y] = array[y-]
- y -=
- array[y] = flag
- , , , , , , , , ]
- print(insert_sort(test))
4.归并排序
python 31行
- :
- left = merge_sort(array[:split_index])
- right = merge_sort(array[split_index:])
- j =
- result = []
- result += (left[i:])
- result += (right[j:])
- ,]
- test = [, , , , , , ]
- print(merge_sort(test))
5.选择排序
python 16行
- , , , , , , , , ]
- print(select_sort(test))
6.快速排序
python 26行
- lists[left] = lists[right]
- lists[right] = lists[left]
- lists[right] = key
- quick_sort(lists, low, left - )
- quick_sort(lists, left + , high)
- , , , , , , , , , ]
- ,len(test)-))