冒泡算法

li[33,4,10,2]

for i in range(len(li)-1):

  current = li[i]

  next_value = li[i+1]

  print(li[i])

  fi li[i]>li[i+1]:

    temp = li[i]

    li[i] = li[i+1]

    li[i+1] = temp

 

for i in range(len(li)-2):

  current = li[i]

  next_value = li[i+1]

  print(li[i])

  fi li[i]>li[i+1]:

    temp = li[i]

    li[i] = li[i+1]

    li[i+1] = temp

 

for i in range(len(li)-3):

  current = li[i]

  next_value = li[i+1]

  print(li[i])

  fi li[i]>li[i+1]:

    temp = li[i]

    li[i] = li[i+1]

    li[i+1] = temp

 

print(li)

 

========================================冒泡排序

li[33,4,10,2]

for j range(1,len(li))

 

for i in range(len(li)-j):

 ## current = li[i]

 ## next_value = li[i+1]

 ## print(li[i])

  fi li[i]>li[i+1]:

    temp = li[i]

    li[i] = li[i+1]

    li[i+1] = temp

 

print(li)

 

posted @ 2018-06-28 11:17  黄瓜不是好瓜  阅读(99)  评论(0编辑  收藏  举报