快速排序算法回顾 --冒泡排序Bubble Sort和快速排序Quick Sort（Python实现）

#coding=utf-8
import time

a=[49,38,65,97,76,13,27,49]
b=[-1,49,38,65,97,76,13,27,49]      #其中b[0]=-1这一位置是暂存单元，用于存放下面算法中的list[low]

#冒泡排序-------------------------------------------------------
def BubbleSort(list):
    for i in reversed(range(len(a))):
        for j in range(0,len(a)-1):
            if(list[j] > list[j+1]):
                temp=list[j]
                list[j]=list[j+1]
                list[j+1]=temp
            j+=1
        i-=1

#快速排序-------------------------------------------------------
def Partition(list,low,high):
    pivotkey=list[low]              #枢轴
    list[0]=list[low]           
    while low<high:                 #从表的两端交替地向中间扫描
        while(low<high and list[high]>=pivotkey):
            high-=1
        list[low]=list[high]        #将比枢轴记录小的移到低端
        while(low<high and list[low]<=pivotkey):
            low+=1
        list[high]=list[low]        #将比枢轴记录大的移到高端
    list[low]=list[0]               #枢轴记录到位
    return low                      #返回枢轴位置

def Qsort(list,low,high):   
    if low<high:
        pivotloc=Partition(list,low,high);      #将list一分为二
        Qsort(list,low,pivotloc-1)              #对低子表递归排序
        Qsort(list,pivotloc+1,high)             #对高子表递归排序

def QuickSort(list):
    Qsort(list,1,len(list)-1)

#---------------------------------------------------------------

start_time=time.time()
BubbleSort(a)
QuickSort(b)
use_time=time.time()-start_time
print ‘Time used: ‘+str(use_time)
print a
print b[1:]