小飞侠编程-Python-排序（while的）

作者：李卓航 更新时间：2025-06-28 09:11 浏览：14次 点赞：0次 热度：20

#插入排序
L=[3,44,38,5,47,15,36,26,27,2,46,4,19,50,48]
i=0
while i<len(L):
    j=i
    while j>0:
        if L[j-1]>L[j]:
            L[j-1],L[j]=L[j],L[j-1]
        j-=1
    i+=1
print(L)
#归并排序
def m(seq):
    if len(seq) <= 1:
        return seq
    mid = len(seq) // 2
    left = m(seq[:mid])
    right = m(seq[mid:])
    return me(left, right)

def me(left, right):
    r = []
    i = 0
    j = 0
    while i < len(left) and j < len(right):
        if left[i] <= right[j]:
            r.append(left[i])
            i += 1
        else:
            r.append(right[j])
            j += 1
    r += left[i:]
    r += right[j:]
    return r

number = [3, 44, 38, 5, 47, 15, 36, 26, 27, 2, 46, 4, 19, 50, 48]

r = m(number)
print(r)
#选择排序

L=[3,44,38,5,47,15,36,26,27,2,46,4,19,50,48]
for i in range(len(L)):
    minL = i
    j = i + 1
    while j < len(L):
        if L[j] < L[minL]:
            minL = j
        j += 1
    L[i], L[minL] = L[minL], L[i]

print(L)
#冒泡排序
L = [3,44,38,5,47,15,36,26,27,2,46,4,19,50,48]
n=len(L)
for i in range(0,len(L)-1):    
    j = 0
    while j < n-1:
        if L[j] > L[j+1]:
            L[j], L[j+1] = L[j+1], L[j]
            
        j += 1
    n -= 1

print(L)