python冒泡排序与插入排序，快速排序

darkfour

于 2017-09-29 16:06:49 发布

阅读量290

点赞数 1

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/darkfour/article/details/78134847

本文详细介绍了三种常见的排序算法：冒泡排序、插入排序和快速排序。通过具体的Python代码示例展示了每种排序算法的工作原理和实现过程。对于理解基本的数据结构操作和算法复杂度具有很好的参考价值。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

# 冒泡排序

a = [3,6,87,21,1,34,6,45]
b = []
for i in range(len(a)-1):
    for j in range(len(a)-i-1):
        if a[i]<a[j+i+1]:
            t = a[i]
            a[i] = a[j+1+i]
            a[j+1+i] = t
print(a)

# 插入排序

a = [3,6,87,21,1,34,6,45,45,43,23,76]
for i in range(1,len(a)):
    k = a[i]
    for j in range(i)[::-1]:
        if k<a[j]:
            a[j+1] = a[j]
            a[j] = k
print(a)

#quick sort
def quickSort(L, low, high):
    i = low
    j = high
    if i >= j:
        return L
    key = L[i]
    while i < j:
        while i < j and L[j] >= key:
            j = j-1
        L[i] = L[j]
        while i < j and L[i] <= key:
            i = i+1
        L[j] = L[i]
    L[i] = key
    quickSort(L, low, i-1)
    quickSort(L, j+1, high)
    return L