Using Python to implement 8 sorting algorithms-bubble sort

The basic idea of bubble sort:

The bubbling sort is to go through two contiguous numbers, and then compare (except for the last number) until the sort is complete.

Cases:

arr = [49,38,04,97,76,13,27,49,55,65], swap

arr = [38,49,04,97,76,13,27,49,55,65], swap

arr = [38,04,49,97,76,13,27,49,55,65], and then visit until sort complete

Code:

def bubble_sort (lists):      #冒泡排序      count = Len (lists) while      count > 0: For          i in range (count-1):  #最后一位 Number does not compare              key = lists[i+1]              if lists[i] > key:                  lists[i], lists[i+1] = key, Lists[i]          count-= 1      return l Ists

