Understanding of bubble sort

Table of Contents

Code for bubble sort

The process of bubble sort

Write Code

Code for bubble sort

def bubbling(list):for i in range(len(list)-1):for l in range(len(list)-1-i):if list[l] > list[l+1]:list[l], list[l + 1] = list[l + 1], list[l]return listif __name__ == '__main__':list = [3,1,44,5,2,30,0]print(bubbling(list))

The process of bubble sorting

Comparing two adjacent numbers, the larger number is placed at the back, and the largest number will be sorted last after the row is complete

In the second round of comparison, only the remaining numbers are compared, and the largest number is still ranked last, and the number of times used is reduced by one

Three rounds of sorting are required for the four numbers

Write Code

First write the first round of sorting, 4 numbers need to be sorted 3 times, if n numbers need to be sorted n-1 times

list = [4,3,2,1]for l in range(len(list)-1): # len(list) is the length of the list 4, which needs to be sorted (4-1) timesif list[l] > list[l+1]: # Compare two adjacent numbers, if the former is greater than the latterlist[l], list[l + 1] = list[l + 1], list[l] # then swap the two positions

After the first round of sorting is completed, continue to perform multiple rounds of sorting, enter a multi-round sorting loop, nest multiple rounds of sorting loops on the outside, 4 numbers need 3 rounds, if n numbers need to be sorted n-1 round

And the number of rounds and the number of rounds have the following relationship

So get the code

list = [4,3,2,1]n = len(list) # len(list) is the length of the list 4for i in range(n-1) # This loop is a round number loop, n numbers need to be sorted for n-1 roundsfor l in range(n-i-1): # This loop is the number of times of each round, and the number of times of each round is n-rounds-1if list[l] > list[l+1]: # Compare two adjacent numbers, if the former is greater than the latterlist[l], list[l + 1] = list[l + 1], list[l] # then the two are swapped