bubble sort

Bubble sort is first from 1 Bit heel 2 A bit more , Move forward if you are older , The maximum value will be placed at the end of the loop once , Cycle twice , The second largest value will be placed in the penultimate number , And so on , Loop the entire list length n You can get a sequence table .

class Solution:
    def search(self,list_num):
        n =len(list_num)
        for j in range(n): #  loop n Time , Repeat the maximum value to the back ,  Until each is sorted 
            for i in range(n-1): # This loop can get a maximum value after the list 
                if list_num[i] > list_num[i+1]:
                    list_num[i] ,list_num[i+1] = list_num[i+1] ,list_num[i]
        return list_num