python实现快速排序的示例(二分法思想)

# coding: utf-8# 快速排序，利用二分思想实现def quick_sort(list, left, right):  if left > right:    return  temp = list[left]  i = left  j = right  while i != j:    # 先从右向左寻找    while list[j] >= temp and i < j:      j -= 1    # 再从左向右寻找    while list[i] <= temp and i < j:      i += 1    if i < j:      t = list[i]      list[i] = list[j]      list[j] = t  # 基准数替换  list[left] = list[i]  list[i] = temp  # 递归调用  quick_sort(list, left, i - 1)  quick_sort(list, i + 1, right)while True:  list = []  try:    num = int(input('你想比较几个数？/n'))  except ValueError:    continue  for k in range(num):    a = int(input('请输入第' + str(k+1) + '个数：/n'))    list.append(a)  quick_sort(list, 0, num-1)  print('排序结果为：')  for l in range(len(list)):    print(list[l], end=' ')  print()