简单手写快排

import sys



def swap(arr,i,j):
    temp = arr[i]
    arr[i] = arr[j]
    arr[j] = temp

def partition(arr,left,right):
    # assert left<=right
    base = arr[left]
    while(left<right):
        if arr[left] < base:
            left+=1
        else:
            if arr[right]>base:
                right-=1
            else:
                if(arr[left]!=arr[right]):
                    swap(arr,left,right)
                else:
                    break
    return left

def QuickSort(arr:list,left,right):
    if(left<right):
        idx = partition(arr,left,right)
        QuickSort(arr,left,idx)
        QuickSort(arr,idx+1,right)
    return arr
for line in sys.stdin:
    a = line.split()
    QuickSort(a,0,len(a)-1)
    print(a)
    # print(int(a[0]) + int(a[1]))

简单手写了一下快排，之后整理思路