选择排序+冒泡排序+快速排序

#SelectSort
array = [9,5,27,18,2,89]
for i in range(len(array)-1):
    for j in range(i+1,len(array)):
        if array[i] > array[j]:
            temp = array[i]
            array[i] = array[j]
            array[j] = temp
print(array)

#BubbuleSort
array = [9,5,27,18,2,89]
flag = False
for i in range(len(array)-1):
    for j in range(len(array)-i-1):
        k=0
        if array[j] > array[j+1]:
            temp = array[j]
            array[j] = array[j+1]
            array[j+1] = temp
            k=1
        if k==1:
            flag = True
            break
    if flag:
        break
print(array)

#QuickSort
def QuickSort(arry, left, right):
    if left>right:
        return -1
    tmp=arry[left]
    i=left
    j=right
    while i!=j:
        while arry[j]>=tmp and i<j:
            j-=1
        while arry[i]<=tmp and i<j:
            i+=1
        if i<j:
            arry[i],arry[j]=arry[j],arry[i]
    arry[left]=arry[i]
    arry[i]=tmp    
    QuickSort(arry,left,i-1)
    QuickSort(arry,i+1,right)
a=[5,1,8,12,43,21,9,31]
QuickSort(a,0,len(a)-1)
print(a)

#计算x的阶乘：
def Fctor(x):
    if x>1:
        return x*Fctor(x-1)
    if x<-1:
        return x*Fctor(x+1)
    if x==1 or x==0 or x==-1:
        return x