用python写个快排

快排过程比较简单就直接上代码了：

 #!/usr/bin/python3

 def quik_sort(L, left, right):
     if left <= right:
         key = L[left]
         i = left
         j = right
         while i < j:
             while i < j and key <= L[j]:
                 j -= 1
             L[i] = L[j]
             while i < j and L[i] <= key:
                 i += 1
             L[j] = L[i]
         L[i] = key
         quik_sort(L, left, i - 1)
         quik_sort(L, i + 1, right)

 a = list(map(int, input().split()))

 quik_sort(a, 0, len(a) - 1)

 for x in a:
     print(x, end = ' ')
 print()

注意：python 中的数字类型是不可变的，因此 x++ 并不会让 x 的值加 1