算法

lst=[1, 3, 5, 13, 43, 55, 55, 434, 464, 565, 665, 3341, 3433, 5646, 33434]
count=0
while count<len(lst):
    i=1
    while i <len(lst)-1:
        if lst[i]>lst[i+1]:
            lst[i],lst[i+1]=lst[i+1],lst[i]
        i+=1
    count+=1
print(lst)

冒泡　　

lst=[1, 3, 5, 13, 43, 55, 55, 434, 464, 565, 665, 3341, 3433, 5646, 33434]
n=55
left=0
right=len(lst)-1
count=1
while left<=right:
    mid=(left+right)//2
    if n < lst[mid]:
        right = mid-1
    if n > lst[mid]:
        left = mid+1
    else:
        print(count)
        print(mid)
        break
        count=count+1
else:
    print("不在")

二分法查看是否在列表

lst=[1,22,33,44,55,66,77,88,99,1112,5555]
def func(n,left,right):
    if left<=right:
        mid=(left+right)//2
        if n<lst[mid]:
            right=mid-1
        elif n>lst[mid]:
            left=mid+1
        else:

            return mid
        return func(n,left,right)#必须加,否则返回的是NONE
    else:
        return  -1
print(func(555,0,len(lst)-1))