Python实现常用排序算法

01.递归实现快排：

            
              def quick_sort(array):
    if len(array)<2:
        return array
    else:
        pivot=array[0]
        less=[x for x in array[1:] if x<=pivot]
        more=[x for x in array[1:] if x>pivot]
        return quick_sort(less)+[pivot]+quick_sort(more)

a=[1,9,4,2,7,5]
print(quick_sort(a))
            
          

02.冒泡排序：

            
              def bubble_sort(array):
    for i in range(len(array)):
        for j in range(len(array)-1-i):
            if array[j]>array[j+1]:
                temp=array[j]
                array[j]=array[j+1]
                array[j+1]=temp
    return array

a=[1,9,4,2,7,5]
print(bubble_sort(a))