快速排序

import  random
arr=[12,88,1,2,5,23,41,56,7,108,25,6,7,5,33,72,9]

def quickSort(a,i,start,end):
    print("********",a,i,start,end)
    if(end-start<=1):
        if (a[start]>a[start]):
            a[start],a[end]=a[end],a[start]
            print(i,a)
        return
    for t in range(start,end):
        if (a[t]>a[i] and t<i):
            a[t],a[i]=a[i],a[t]
            i=t
            print(i,a)
        if (t > i):
            if a[t] >= a[i]:
                continue;

            if(t-i==1):
                a[t], a[i] = a[i], a[t]
                i = t
                print( i, a )
            else:
                a[t], a[i+1] = a[i+1], a[t]
                a[i], a[i+1] = a[i+1], a[i]
                i = i+1
                print(12, i, a )
    quickSort(a,random.randint(start,i),start,i)
    quickSort(a,random.randint(i,end),i,end)

print(arr)
quickSort(arr,5,0,len(arr))

print(arr)


改進 

import  random
arr=[12,88,1,2,5,23,41,56,7,108,72,342,23,33,74,25,6,7,5,33,72,9]

def quickSort(a,start,end):
    if (end-1 <= start ):
        return
    print("********",a,start,end,a[start:end])
    i=random.randint(start,end-1)
    print("******#",i)

    if(end-1-start==1):
        if (a[start]>a[end-1]):
            a[start],a[end-1]=a[end-1],a[start]
            print(i,a)
        return
    for t in range(start,end):
        if (a[t]>a[i] and t<i):
            a[t],a[i]=a[i],a[t]
            i=t
            print(i,a)
        if (t > i):
            if a[t] >= a[i]:
                continue;
            if(t-i==1):
                a[t], a[i] = a[i], a[t]
                i = t
            else:
                a[t], a[i+1] = a[i+1], a[t]
                a[i], a[i+1] = a[i+1], a[i]
                i = i+1
                print(12, i, a )
    quickSort(a,start,i)
    quickSort(a,i,end)

quickSort(arr,0,len(arr))

print(arr)


import  random
arr=[12,88,1,2,5,23,41,56,7,108,72,342,23,33,74,25,6,7,5,33,72,9]

def quickSort(a,start,end):
    if (end-1 <= start ):
        return
    print("********",a,start,end,a[start:end])
    i=random.randint(start,end-1)
    print("******#",i)

    if(end-1-start==1):
        if (a[start]>a[end-1]):
            a[start],a[end-1]=a[end-1],a[start]
            print(i,a)
        return
    for t in range(start,end):
        if (a[t]>a[i] and t<i):
            a[t],a[i]=a[i],a[t]
            i=t
        if (t > i):
            if a[t] >= a[i]:
                continue;
            a[t], a[i + 1] = a[i + 1], a[t]
            if(t-i>1):
                a[i], a[i+1] = a[i+1], a[i]
            i = i + 1
    quickSort(a,start,i)
    quickSort(a,i,end)

quickSort(arr,0,len(arr))

print(arr)

 

發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.
相關文章