冒泡排序，选择排序，插入排序，快速排序的简单性能测试

#filename: test.py
import time
import random

def quickSort(arr,l,r):
    if(l < r):
        i = l
        j = r
        x = arr[l]
        k = l
        while i < j:
            while i<j and arr[j]>x:
                j = j-1
            if i < j:
                arr[k] = arr[j]
                k = j
                i = i+1
            while i<j and arr[i]<x:
                i = i+1
            if i < j:
                arr[k] = arr[i]
                k = i
                j = j-1

        arr[k] = x
        quickSort(arr,l,k-1)
        quickSort(arr,k+1,r)

def insertSort(arr,begin,end):
    i = begin+1
    while i<=end:
        x = arr[i]
        k = i
        j = i-1
        while j >= begin and arr[j]>x:
           arr[j+1]=arr[j]
           k = j
           j = j-1
        arr[k]=x
        i = i+1

def bubbleSort(arr,begin,end):
    i=end
    while i>begin:
        j=begin
        while j<i:
            if arr[j]>arr[j+1]:
                arr[j],arr[j+1] = arr[j+1],arr[j]
            j = j+1
        i = i-1

def selectSort(arr,begin,end):
    i=begin
    while i<end:
        j=i+1
        while j<=end:
            if arr[i]>arr[j]:
                arr[i],arr[j] = arr[j],arr[i]
            j = j+1
        i = i+1

arr = range(1,10000)
funs = (quickSort,insertSort,bubbleSort,selectSort)
for sort in funs:
    random.shuffle(arr)
    time1 = time.time()
    sort(arr,0,len(arr)-1)
    time2 = time.time()
    print time2-time1